We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Hidden behind a sums of squares formula 
are other such formulae not obtainable by restriction. This drastically simplifies the combinatorics involved in the existence problem of sums of squares formulae, and leads to a proof that the product of two sums of 16 squares cannot be rewritten as a sum of 28 squares, if only integer coefficients are permitted. We also construct all [10, 10, 16]
formulae.
