Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-17T23:30:59.117Z Has data issue: false hasContentIssue false

Sums of Squares Formulae With Integer Coefficients

Published online by Cambridge University Press:  20 November 2018

Paul Y. H. Yiu*
Affiliation:
Department of Mathematics University of British Columbia Vancouver, B.C. Canada
*
Current address: Department of Mathematics Ohio State University Columbus, Ohio 43210, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1987