Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-25T06:12:21.522Z Has data issue: false hasContentIssue false
  • English
  • Français

Lattice points in a convex Set of given width

Published online by Cambridge University Press:  09 April 2009

G. B. Elkington  and
J. Hammer
G. B. Elkington
Affiliation:
Department of Pure Mathematics, University of Sydney N.S.W., Australia
J. Hammer
Affiliation:
Department of Pure Mathematics, University of Sydney N.S.W., Australia
Rights & Permissions [Opens in a new window]

Extract

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 S be a closed bounded convex set in d-dimensional Euclidean space Ed. The width w(S) of S is the minimum distance between supporting hyperplanes of S, and L(S) is the number of integral lattice points in the interior of S.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 21 , Issue 4 , June 1976 , pp. 504 - 507
Copyright
Copyright © Australian Mathematical Society 1976

References

Niven, I. and Zuckerman, H. S., (1967), ‘Lattice points in regions’, Proc. Amer. Math. Soc. 18, 364–370.CrossRefGoogle Scholar
Sallee, G. T. (1969), ‘The maximal set of constant width in a lattice’, Pacific. J. Math. 28, 669–674.CrossRefGoogle Scholar
Scott, P. R. (1973), ‘A lattice problem in the plane’, Mathematika 20, 247–252.CrossRefGoogle Scholar