A method to generate upper bounds for the sums of squares formulae problem (Q2565259): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / author | |||
Property / author: Adolfo Sánchez-Flores / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: A. R. Rajwade / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 08:36, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A method to generate upper bounds for the sums of squares formulae problem |
scientific article |
Statements
A method to generate upper bounds for the sums of squares formulae problem (English)
0 references
11 March 1997
0 references
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.
0 references
sums of squares formulae problem
0 references
lower bounds
0 references
irreducible configurations for juxtaposing matrices
0 references
intercalate matrix
0 references
algorithm
0 references
upper bounds
0 references