The isodiametric problem for lattice-point-free convex sets (Q2466350)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The isodiametric problem for lattice-point-free convex sets |
scientific article |
Statements
The isodiametric problem for lattice-point-free convex sets (English)
0 references
14 January 2008
0 references
The second author [Bull. Aust. Math. Soc. 51, 163--169 (1995; Zbl 0829.52007)] has generalized the isodiametric inequality for lattice-point-free planar convex sets by \textit{P. R. Scott} [Math. Mag. 47, 218--221 (1974; Zbl 0295.52005)] to arbitrary lattices. In the present paper the authors solve the isodiametric problem for lattice-point-free convex sets in a more proper sense: Let \(L\) be an arbitrary lattice in the Euclidean plane. For each feasible value \(D\) characterize the convex set of diameter \(D\) (containing no interior points of \(L\)) which has maximum area. For a more general version of the isodiametric problem we refer to a paper of \textit{W. Barthel} and \textit{H. Pabel} [Result. Math. 12, 252--267 (1987; Zbl 0633.52010)].
0 references
isodiametric inequality
0 references
lattices
0 references
planar convex sets
0 references