On lattice points in a convex decagon (Q2648023): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Walter Ledermann / rank | |||
Property / author | |||
Property / author: Kurt Mahler / rank | |||
Property / author | |||
Property / author: Walter Ledermann / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Kurt Mahler / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The theorem of Minkowski-Hlawka / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5810636 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02395026 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2011053821 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:37, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On lattice points in a convex decagon |
scientific article |
Statements
On lattice points in a convex decagon (English)
0 references
1949
0 references
Es sei \(K\) ein konvexer Bereich und \(V(K)\) sein Flächeninhalt. Ein Gitter heißt \(K\)-zulässig, wenn \(0\) der einzige Gitterpunkt innerhalb \(K\) ist. Unter allen zulässigen Gittern heißen jene kritisch, die die kleinste Determinante \(\Delta(K)\) besitzen. Es sei \(Q(K) = V(K)/\Delta(K)\). Speziell werde \(Q(\Pi_n)\) betrachtet, wo unter \(\Pi_n\) die symmetrischen konvexen Polygone mit \(2n\) Seiten verstanden werden. Es sei \(Q_n = \min Q(\Pi_n)\). Es wird gezeigt, daß \(Q_5 = 3,62\ldots\) ist und für ein nicht reguläres Zehneck angenommen wird. Ferner wird auch \(Q(D)\) für die Zehnecke \(D\) dünnster dichtester Lagerung berechnet.
0 references
lattice points
0 references
convex decagon
0 references
packings
0 references