The authors introduce the notion of a \textit{primitive zonotope}: a zonotope generated by the primitive integer vectors of \(q\)-norm \(\leq p\), that is, \[ Z_q(d, p) := \left\{ \lambda_v v : \, v \in \mathbb{Z}^d, \;\|v\|_q \leq p, \;\gcd(v) = 1, \;v \succ 0, \;0 \leq \lambda_v \leq 1 \right\} . \] Here \(\succ\) denotes the lexicographic order, i.e., \(v \succ 0\) means that the first nonzero entry of \(v\) is positive. These polytopes are interesting because they have a large symmetry group, a large diameter, and many vertices relative to their grid embedding size. The authors derive several properties of primitive zonotopes, including lower bounds for their diameters and connections to the computational complexity of multicriteria matroid optimization.
- A counterexample to the Hirsch conjecture
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- An improved Kalai-Kleitman bound for the diameter of a polyhedron
- Convex combinatorial optimization
- Convex integer optimization by constantly many linear counterparts
- Convex Polytopes
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Eventual quasi-linearity of the Minkowski length
- scientific article; zbMATH DE number 3841894 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Improved bounds on the diameter of lattice polytopes
- Improving bounds on the diameter of a polyhedron in high dimensions
- Lectures on Polytopes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Nonlinear discrete optimization. An algorithmic theory
- On the diameter of convex polytopes
- On the diameter of lattice polytopes
- On the maximal number of edges of convex digital polygons included into an m m-grid
- The Hirsch conjecture is true for (0,1)-polytopes
- Small primitive zonotopes
- On Dantzig figures from graded lexicographic orders
- Belt distance between facets of space-filling zonotopes
- Belt diameter of -zonotopes
- Short simplex paths in lattice polytopes
- The diagonal of the operahedra
- Distance between vertices of lattice polytopes
- Elementary moves on lattice polytopes
- An asymptotically improved upper bound on the diameter of polyhedra
- Improving bounds on the diameter of a polyhedron in high dimensions
- scientific article; zbMATH DE number 21966 (Why is no real title available?)
- The vertices of primitive zonotopes
- The diameter of lattice zonotopes
- A brief survey on lattice zonotopes
- Diameter, decomposability, and Minkowski sums of polytopes
- Primitive point packing
- A linear optimization oracle for zonotope computation
This page was built for publication: Primitive zonotopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724942)