Sporadic Reinhardt polygons
From MaRDI portal
Publication:1953052
DOI10.1007/s00454-012-9479-4zbMath1280.52015arXiv1203.4107MaRDI QIDQ1953052
Kevin G. Hare, Michael J. Mossinghoff
Publication date: 7 June 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.4107
width; diameter; isoperimetric problem; perimeter; isodiametric problem; Reinhardt polynomial; Reinhardt polygon
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
52B60: Isoperimetric problems for polytopes
52A10: Convex sets in (2) dimensions (including convex curves)
11R09: Polynomials (irreducibility, etc.)
Related Items
The equilateral small octagon of maximal width, Most Reinhardt polygons are sporadic, Tight bounds on the maximal perimeter and the maximal width of convex small polygons, Tight bounds on the maximal perimeter of convex equilateral small polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating isodiametric and isoperimetric polygons
- A discrete isoperimetric problem
- Isoperimetric polygons of maximum width
- On convex polygons of maximal width
- Isodiametric problems for polygons
- A $1 Problem
- A note on the cyclotomic polynomial
- Über das Kreisteilungspolynom