Minkowski length of 3D lattice polytopes

DOI10.1007/s00454-012-9433-5zbMath1262.52009arXiv1202.0524OpenAlexW1985005004MaRDI QIDQ1930539

Bradley Weaver, Olivia Beckwith, Matthew Grimm, Evgenia Soprunova

Publication date: 11 January 2013

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.0524

zbMATH Keywords

Minkowski sumlattice polytopesMinkowski lengthtoric codes

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Related Items

Lattice polytopes in coding theory, $\mathbb{F}_q$-Zeros of Sparse Trivariate Polynomials and Toric 3-Fold Codes, A point in an \(nd\)-polytope is the barycenter of \(n\) points in its \(d\)-faces, Eventual quasi-linearity of the Minkowski length, Enumeration of lattice 3-polytopes by their number of lattice points, Lattice 3-polytopes with six lattice points, Lattice 3-polytopes with few lattice points

Uses Software

• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the parameters of \(r\)-dimensional toric codes
• Toric Fano three-folds with terminal singularities
• Integral Polyhedra in Three Space
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Toric Surface Codes and Minkowski Length of Polygons
• Toric Surface Codes and Minkowski Sums
• A Primal Barvinok Algorithm Based on Irrational Decompositions