Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T16:44:21.206Z Has data issue: false hasContentIssue false

The Hadamard conjecture and integer lattices

Published online by Cambridge University Press:  09 April 2009

J. McCall
Affiliation:
Department of Mathematics and StatisticsMassey UniversityPalmerston North, New Zealand
C. H. C. Little
Affiliation:
Department of Mathematics and StatisticsMassey UniversityPalmerston North, New Zealand
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.

Let L be an integer lattice, and S a set of lattice points in L. We say that S is optimal if it minimises the number of rectangular sublattices of L (including degenerate ones) which contain an even number of points in S. We show that the resolution of the Hadamard conjecture is equivalent to the determination of |S| for an optimal set S in a (4s-1) × (4s-1) integer lattice L. We then specialise to the case of 1 × n integer lattices, characterising and enumerating their optimal sets.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1987