A method to generate upper bounds for the sums of squares formulae problem

Publication date 11 March 1997

Published in Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

algorithm intercalate matrix irreducible configurations for juxtaposing matrices lower bounds sums of squares formulae problem upper bounds

Mathematics Subject Classification ID

Designs and configurations (05B99) Sums of squares and representations by other particular quadratic forms (11E25)

Review text

The smallest integer \(t\) for which an identity \[ (x^2_1+ \cdots+ x^2_r) (y^2_1+ \cdots +y^2_s)^2 =z^2_1+ \cdots+ z^2_t \tag{1} \] exists is denoted by \(r*_\mathbb{Z} s\) \((z_i\) bilinear in the \(x_j,y_k\) with integer coefficients). It is known that (1) exists iff an \(r\times s\) consistently signed intercalate matrix of type \([r,s,t]\) exists. Best upper bounds for \(r*_\mathbb{Z} s\) \((1\leq r,s \leq 64)\) have been obtained in the past by juxtaposing two or more matrices of smaller size. The present paper gives irreducible configurations that juxtapose \(k\) matrices for \(k\leq q\). Further, the author gives an algorithm that yields the lowest bound on \(r*_\mathbb{Z} s\) from upper bounds on \(a*_\mathbb{Z} b\) \((a\leq r,b\leq s,a+ b<r+s)\). More new upper bounds on \(r*_\mathbb{Z} s\) \((1\leq r,s \leq 64)\) are obtained by using the above machinery.

Recommendations

Cited in

(9)

This page was built for publication: A method to generate upper bounds for the sums of squares formulae problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565259)