An asymptotic bound on integer sums of squares
نویسندگان
چکیده
Let σZ(k) be the smallest n such that there exists an identity (x1 + x 2 2 + · · ·+ xk) · (y 1 + y 2 + · · ·+ y k) = f 1 + f 2 + · · ·+ f n , with f1, . . . fn being polynomials with integer coefficients in the variables x1, . . . , xk and y1, . . . , yk. We prove that σZ(k) ≥ Ω(k).
منابع مشابه
Asymptotic Behavior of Weighted Sums of Weakly Negative Dependent Random Variables
Let be a sequence of weakly negative dependent (denoted by, WND) random variables with common distribution function F and let be other sequence of positive random variables independent of and for some and for all . In this paper, we study the asymptotic behavior of the tail probabilities of the maximum, weighted sums, randomly weighted sums and randomly indexed weighted sums of heavy...
متن کاملAn Asymptotic Bound on the Composition Number of Integer Sums of Squares Formulas
Let σZ(k) be the smallest n such that there exists an identity (x 1 + x 2 2 + · · · + x 2 k) · (y 2 1 + y 2 2 + · · · + y 2 k) = f 2 1 + f 2 2 + · · · + f 2 n , with f1, . . . , fn being polynomials with integer coefficients in the variables x1, . . . , xk and y1, . . . , yk. We prove that σZ(k) ≥ Ω(k 6/5).
متن کاملExplicit Bounds for Sums of Squares
For an even integer k, let r2k(n) be the number of representations of n as a sum of 2k squares. The quantity r2k(n) is approximated by the classical singular series ρ2k(n) nk−1. Deligne’s bound on the Fourier coefficients of Hecke eigenforms gives that r2k(n) = ρ2k(n) + O(d(n)n k−1 2 ). We determine the optimal implied constant in this estimate provided that either k/2 or n is odd. The proof re...
متن کامل1 F eb 2 00 5 ON SUMS OF THREE SQUARES
Let r 3 (n) be the number of representations of a positive integer n as a sum of three squares of integers. We give two distinct proofs of a conjecture of Wagon concerning the asymptotic value of the mean square of r 3 (n).
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کامل