A method to generate upper bounds for the sums of squares formulae problem (Q2565259): Difference between revisions

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.