Zur Gitterpunktüberdeckung durch reguläre n-Ecke mit ungerader Eckenzahl. (On lattice-point-coverings by regular n-gons with an odd number of vertices)

MaRDI QIDQ582583zbMATH OpenFDO

Authors Werner Mögling

Publication date 1987

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

zbMATH Keywords

lattice point coveringregular polygon

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Review text

The author determines the largest square that can be inscribed into a regular polygon with an odd number n of vertices, or, equivalently, the minimum size of a regular n-gon that has the lattice point covering property. For even n he had already solved the problem. The delicacy and tediousness of argument and computation seems to be inherent to the problem.

Recommendations

• scientific article; zbMATH DE number 4011343
• On the lattice point covering problem in dimension 2
• scientific article; zbMATH DE number 6938032
• On a problem of Croft on optimally nested regular polygons
• When is a polygon circumscribing a regular polygon again regular?

Cited in

(5)

• On the lattice point covering problem in dimension 2
• scientific article; zbMATH DE number 3925709 (Why is no real title available?)
• scientific article; zbMATH DE number 4005040 (Why is no real title available?)
• scientific article; zbMATH DE number 4011343 (Why is no real title available?)
• On a problem of Croft on optimally nested regular polygons

This page was built for publication: Zur Gitterpunktüberdeckung durch reguläre n-Ecke mit ungerader Eckenzahl. (On lattice-point-coverings by regular n-gons with an odd number of vertices)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582583)