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) (Q582583): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / 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. | |||
| Property / 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jonathan Schaer / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52C07 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52A40 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52C17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4131171 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
regular polygon | |||
| Property / zbMATH Keywords: regular polygon / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
lattice point covering | |||
| Property / zbMATH Keywords: lattice point covering / rank | |||
Normal rank | |||
Revision as of 19:10, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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) |
scientific article |
Statements
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) (English)
0 references
1987
0 references
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.
0 references
regular polygon
0 references
lattice point covering
0 references
