Jarník's convex lattice \(n\)-gon for non-symmetric norms (Q415495): Difference between revisions
From MaRDI portal
Created a new Item |
Import recommendations run Q6534273 |
||||||
(8 intermediate revisions by 7 users not shown) | |||||||
Property / DOI | |||||||
Property / DOI: 10.1007/s00209-010-0816-0 / rank | |||||||
Property / review text | |||||||
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. | |||||||
Property / review text: 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. / rank | |||||||
Normal rank | |||||||
Property / reviewed by | |||||||
Property / reviewed by: Lenny Fukshansky / rank | |||||||
Normal rank | |||||||
Property / Mathematics Subject Classification ID | |||||||
Property / Mathematics Subject Classification ID: 52B60 / rank | |||||||
Normal rank | |||||||
Property / Mathematics Subject Classification ID | |||||||
Property / Mathematics Subject Classification ID: 52C05 / rank | |||||||
Normal rank | |||||||
Property / Mathematics Subject Classification ID | |||||||
Property / Mathematics Subject Classification ID: 49K30 / rank | |||||||
Normal rank | |||||||
Property / zbMATH DE Number | |||||||
Property / zbMATH DE Number: 6031806 / rank | |||||||
Normal rank | |||||||
Property / zbMATH Keywords | |||||||
convex lattice polygon | |||||||
Property / zbMATH Keywords: convex lattice polygon / rank | |||||||
Normal rank | |||||||
Property / zbMATH Keywords | |||||||
primitive vectors | |||||||
Property / zbMATH Keywords: primitive vectors / rank | |||||||
Normal rank | |||||||
Property / zbMATH Keywords | |||||||
isoperimetric problem | |||||||
Property / zbMATH Keywords: isoperimetric problem / rank | |||||||
Normal rank | |||||||
Property / MaRDI profile type | |||||||
Property / MaRDI profile type: Publication / rank | |||||||
Normal rank | |||||||
Property / OpenAlex ID | |||||||
Property / OpenAlex ID: W2129611928 / rank | |||||||
Normal rank | |||||||
Property / arXiv ID | |||||||
Property / arXiv ID: 0911.4361 / rank | |||||||
Normal rank | |||||||
Property / cites work | |||||||
Property / cites work: The minimum area of convex lattice \(n\)-gons / rank | |||||||
Normal rank | |||||||
Property / cites work | |||||||
Property / cites work: On maximal convex lattice polygons inscribed in a plane convex set / rank | |||||||
Normal rank | |||||||
Property / cites work | |||||||
Property / cites work: Q3856819 / rank | |||||||
Normal rank | |||||||
Property / cites work | |||||||
Property / cites work: Limit shape of convex lattice polygons with minimal perimeter / rank | |||||||
Normal rank | |||||||
Property / DOI | |||||||
Property / DOI: 10.1007/S00209-010-0816-0 / rank | |||||||
Normal rank | |||||||
Property / Recommended article | |||||||
Property / Recommended article: Limit shape of convex lattice polygons with minimal perimeter / rank | |||||||
Normal rank | |||||||
Property / Recommended article: Limit shape of convex lattice polygons with minimal perimeter / qualifier | |||||||
Similarity Score: 0.8459183
| |||||||
Property / Recommended article: Limit shape of convex lattice polygons with minimal perimeter / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: Extremal problems on convex lattice polygons in sense of \(l_p\)-metrics / rank | |||||||
Normal rank | |||||||
Property / Recommended article: Extremal problems on convex lattice polygons in sense of \(l_p\)-metrics / qualifier | |||||||
Similarity Score: 0.83023155
| |||||||
Property / Recommended article: Extremal problems on convex lattice polygons in sense of \(l_p\)-metrics / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: Q4794057 / rank | |||||||
Normal rank | |||||||
Property / Recommended article: Q4794057 / qualifier | |||||||
Similarity Score: 0.8211994
| |||||||
Property / Recommended article: Q4794057 / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: On the self-perimeter of pentagonal gauges / rank | |||||||
Normal rank | |||||||
Property / Recommended article: On the self-perimeter of pentagonal gauges / qualifier | |||||||
Similarity Score: 0.81415915
| |||||||
Property / Recommended article: On the self-perimeter of pentagonal gauges / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: On maximal convex lattice polygons inscribed in a plane convex set / rank | |||||||
Normal rank | |||||||
Property / Recommended article: On maximal convex lattice polygons inscribed in a plane convex set / qualifier | |||||||
Similarity Score: 0.80533767
| |||||||
Property / Recommended article: On maximal convex lattice polygons inscribed in a plane convex set / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: Q4836004 / rank | |||||||
Normal rank | |||||||
Property / Recommended article: Q4836004 / qualifier | |||||||
Similarity Score: 0.7940289
| |||||||
Property / Recommended article: Q4836004 / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: The Perimeter of optimal convex lattice polygons in the sense of different metrics / rank | |||||||
Normal rank | |||||||
Property / Recommended article: The Perimeter of optimal convex lattice polygons in the sense of different metrics / qualifier | |||||||
Similarity Score: 0.7919431
| |||||||
Property / Recommended article: The Perimeter of optimal convex lattice polygons in the sense of different metrics / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: Limit shape of optimal convex Lattice polygons in the sense of different metrics. / rank | |||||||
Normal rank | |||||||
Property / Recommended article: Limit shape of optimal convex Lattice polygons in the sense of different metrics. / qualifier | |||||||
Similarity Score: 0.7853068
| |||||||
Property / Recommended article: Limit shape of optimal convex Lattice polygons in the sense of different metrics. / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: The minimum area of convex lattice \(n\)-gons / rank | |||||||
Normal rank | |||||||
Property / Recommended article: The minimum area of convex lattice \(n\)-gons / qualifier | |||||||
Similarity Score: 0.7758306
| |||||||
Property / Recommended article: The minimum area of convex lattice \(n\)-gons / qualifier | |||||||
Property / Recommended article | |||||||
Property / Recommended article: On Finding The Limit Shape Of Optimal Convex Lattice Polygons / rank | |||||||
Normal rank | |||||||
Property / Recommended article: On Finding The Limit Shape Of Optimal Convex Lattice Polygons / qualifier | |||||||
Similarity Score: 0.7755496
| |||||||
Property / Recommended article: On Finding The Limit Shape Of Optimal Convex Lattice Polygons / qualifier | |||||||
links / mardi / name | links / mardi / name | ||||||
Latest revision as of 19:45, 27 January 2025
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
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
0.8459183
0 references
0.83023155
0 references
0.81415915
0 references
0.80533767
0 references
0.7919431
0 references
0.7853068
0 references
0.7758306
0 references