Lattice reduced and complete convex bodies

DOI10.1112/JLMS.12982MaRDI QIDQ6641549

Giulia Codenotti, Ansgar Freyer

Publication date: 20 November 2024

Published in: Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)

zbMATH Keywords

integer programminglattice widthflatness constant`lattice reduced' convex body

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Combinatorial complexity of geometric structures (52C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variations of Minkowski's theorem on successive minima
• Reduced convex bodies in Euclidean space -- a survey
• Complete sets need not be reduced in Minkowski spaces
• Reduced bodies in Minkowski space
• Reduced convex bodies in the plane
• Blowing up convex sets in the plane
• Covering minima and lattice-point-free convex bodies
• On the smallest disk containing a planar reduced convex body
• Ein Minimumproblem für Ovale.
• Konvexe Bereiche gegebener konstanter Breite und kleinsten Inhalts.
• Is a complete, reduced set necessarily of constant width?
• On the Dirichlet-Voronoi cell of unimodular lattices
• Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
• A proof of Lovász's theorem on maximal lattice-free sets
• Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
• Hunting for reduced polytopes
• Minimal polygons with fixed lattice width
• A local maximizer for lattice width of 3-dimensional hollow bodies
• Lattice-free simplices with lattice width \(2d - o(d)\)
• Complete spherical convex bodies
• On successive minima-type inequalities for the polar of a convex body
• On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace
• Curves of constant width in the non-Euclidean geometry
• On a strengthening of the Blaschke-Leichtweiss theorem
• On the three-dimensional Blaschke-Lebesgue problem
• Integer Programming with a Fixed Number of Variables
• Classification of empty lattice 4-simplices of width larger than two
• The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
• Spherical Geometry—A Survey on Width and Thickness of Convex Bodies
• Bodies of constant width in arbitrary dimension
• Convex and Discrete Geometry
• Convex Bodies The Brunn-MinkowskiTheory
• Convex Bodies of Constant Width in Spaces of Constant Curvature and the Extremal Area of Reuleaux Triangles
• On the lattice diameter of a convex polygon
• Polynomial bounds in Koldobsky's discrete slicing problem

This page was built for publication: Lattice reduced and complete convex bodies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641549)