A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6534273
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2021.04.009 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1907.06199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Lovász's theorem on maximal lattice-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the lattice width of lattice-free convex sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hollow polytopes of large width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3531415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blowing up convex sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of empty lattice 4-simplices of width larger than two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering minima and lattice-point-free convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5785796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances between non-symmetric convex bodies and the \(MM^*\)-estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Polyhedra in Three Space / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2021.04.009 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Hollow polytopes of large width / rank
 
Normal rank
Property / Recommended article: Hollow polytopes of large width / qualifier
 
Similarity Score: 0.86458874
Amount0.86458874
Unit1
Property / Recommended article: Hollow polytopes of large width / qualifier
 
Property / Recommended article
 
Property / Recommended article: Hollow lattice polytopes: Latest advances in classification and relations with the width / rank
 
Normal rank
Property / Recommended article: Hollow lattice polytopes: Latest advances in classification and relations with the width / qualifier
 
Similarity Score: 0.76065266
Amount0.76065266
Unit1
Property / Recommended article: Hollow lattice polytopes: Latest advances in classification and relations with the width / qualifier
 
Property / Recommended article
 
Property / Recommended article: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / rank
 
Normal rank
Property / Recommended article: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / qualifier
 
Similarity Score: 0.75255185
Amount0.75255185
Unit1
Property / Recommended article: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lattice-Width Directions and Minkowski's $3^d$-Theorem / rank
 
Normal rank
Property / Recommended article: Lattice-Width Directions and Minkowski's $3^d$-Theorem / qualifier
 
Similarity Score: 0.7229812
Amount0.7229812
Unit1
Property / Recommended article: Lattice-Width Directions and Minkowski's $3^d$-Theorem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Lattice-free simplices with lattice width \(2d - o(d)\) / rank
 
Normal rank
Property / Recommended article: Lattice-free simplices with lattice width \(2d - o(d)\) / qualifier
 
Similarity Score: 0.6984046
Amount0.6984046
Unit1
Property / Recommended article: Lattice-free simplices with lattice width \(2d - o(d)\) / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the width of a planar convex set containing zero or one lattice points / rank
 
Normal rank
Property / Recommended article: On the width of a planar convex set containing zero or one lattice points / qualifier
 
Similarity Score: 0.6969759
Amount0.6969759
Unit1
Property / Recommended article: On the width of a planar convex set containing zero or one lattice points / qualifier
 
Property / Recommended article
 
Property / Recommended article: A bound on the ratio between the packing and covering densities of a convex body / rank
 
Normal rank
Property / Recommended article: A bound on the ratio between the packing and covering densities of a convex body / qualifier
 
Similarity Score: 0.69175947
Amount0.69175947
Unit1
Property / Recommended article: A bound on the ratio between the packing and covering densities of a convex body / qualifier
 
Property / Recommended article
 
Property / Recommended article: Covering sets for plane lattices / rank
 
Normal rank
Property / Recommended article: Covering sets for plane lattices / qualifier
 
Similarity Score: 0.6913451
Amount0.6913451
Unit1
Property / Recommended article: Covering sets for plane lattices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computational determination of the largest lattice polytope diameter / rank
 
Normal rank
Property / Recommended article: Computational determination of the largest lattice polytope diameter / qualifier
 
Similarity Score: 0.69019186
Amount0.69019186
Unit1
Property / Recommended article: Computational determination of the largest lattice polytope diameter / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4263727 / rank
 
Normal rank
Property / Recommended article: Q4263727 / qualifier
 
Similarity Score: 0.6900447
Amount0.6900447
Unit1
Property / Recommended article: Q4263727 / qualifier
 

Latest revision as of 19:48, 27 January 2025

scientific article
Language Label Description Also known as
English
A local maximizer for lattice width of 3-dimensional hollow bodies
scientific article

    Statements

    A local maximizer for lattice width of 3-dimensional hollow bodies (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2021
    0 references
    Consider a convex body \(K\) contained in the \(d\)-dimensional Euclidean space \(\mathbb{R}^d\) and a non-zero vector \(v\) in that space. The width of \(K\) along \(v\) is equal to \(\|v\|\) times the length of the orthogonal projection of \(K\) on a straight line spanned by \(v\). Then if \(\Lambda\) is a \(d\)-dimensional lattice contained in \(\mathbb{R}^d\) (for instance, \(\mathbb{Z}^d\)), the lattice width of \(K\) is the least possible width of \(K\) along the non-zero vectors in the dual lattice of \(\Lambda\). A convex body is hollow when its interior is disjoint from \(\Lambda\). The flatness theorem tells that the lattice width of any hollow convex body is bounded by a finite number that only depends on \(d\). This theorem and the largest possible lattice width \(f(d)\) of \(d\)-dimensional hollow convex bodies play an important role in integer programming as reported, for instance by \textit{R. Kannan} and \textit{L. Lovász} [Ann. Math. (2) 128, No. 3, 577--602 (1988; Zbl 0659.52004)]. It is known that \(f(1)=1\) and \textit{C. A. J. Hurkens} has shown that \(f(2)=1+2/\sqrt{3}\) [Linear Algebra Appl. 134, 121--128 (1990; Zbl 0708.52002)]. When \(d=3\), Giulia Codenotti and Francisco Santos have found a hollow tetrahedron \(\Delta\) whose lattice width is \(2+\sqrt{2}\) and they conjecture that \(f(3)\) is equal to this value [\textit{G. Codenotti} and \textit{F. Santos}, Proc. Am. Math. Soc. 148, No. 2, 835--850 (2020; Zbl 1445.52012)]. Here, it is shown that there exists an open set \(U\) in \(\mathbb{R}^3\) that contains \(\Delta\) and such that every hollow convex body contained in \(U\) has lattice width less than \(2+\sqrt{2}\). In other words, \(\Delta\) is a local minimum with respect to lattice width. The proof consists in parametrizing the space of the hollow tetrahedra obtained by perturbing \(\Delta\) and by using Karush-Kuhn-Tucker conditions to search for a local maximum in that space. Necessary conditions are also given for a \(3\)-dimensional hollow convex body to have lattice width greater than \(2+\sqrt{2}\).
    0 references
    lattice polytopes
    0 references
    hollow bodies
    0 references
    lattice width
    0 references
    flatness constant
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references