Jarník's convex lattice \(n\)-gon for non-symmetric norms (Q415495)

From MaRDI portal
Revision as of 19:32, 29 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Jarník's convex lattice \(n\)-gon for non-symmetric norms
scientific article

    Statements

    Jarník's convex lattice \(n\)-gon for non-symmetric norms (English)
    0 references
    0 references
    0 references
    8 May 2012
    0 references
    Let \(D \subset {\mathbb R}^2\) be a convex compact set with \(0 \in {\text{int}} D\), and define the corresponding norm \[ \|x\| = \|x\|_D := \min \{ t \geq 0 : x \in tD \} \] for every \(x \in {\mathbb R}^2\). For an integer \(n \geq 3\), let \({\mathcal P}_n\) be the set of all convex \(n\)-gons in \({\mathbb R}^2\) with vertices on the points of the integer lattice \({\mathbb Z}^2\). What is the minimal perimeter \(L_n(D)\) of a polygon in~\({\mathcal P}_n\)? In the case when \(D\) is the unit circle centered at the origin in~\({\mathbb R}^2\) (i.e., \(\|\;\|\) is the usual Euclidean norm), an asymptotic answer to this question as \(n \to \infty\) has been provided by \textit{V. Jarník} [M. Z. 24, 500--518 (1925; JFM 51.0153.01)]. More recently, this question has been considered by \textit{M. Prodromou} for any symmetric~\(D\) [Discrete Math. 300, No. 1-3, 139--151 (2005; Zbl 1081.52001)]. The goal of the present paper is to address the question for an arbitrary set~\(D\), not necessarily symmetric. Specifically, the authors establish the asymptotic behavior of \(L_n(D)\) for all norms and, furthermore, show that, after suitable scaling, the minimizing polygons have a limiting shape. The argument uses some of Jarník's original ideas after a suitable centering procedure of the original norm. The proof of the existence of a limit shape in the general situation is substantially more difficult than in the symmetric case.
    0 references
    convex lattice polygon
    0 references
    primitive vectors
    0 references
    isoperimetric problem
    0 references

    Identifiers