On lattice diameter segments: algorithms and structure
From MaRDI portal
Cites work
- A 64-dimensional counterexample to Borsuk's conjecture
- A counterexample to Borsuk’s conjecture
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- Bounds on the lattice point enumerator via slices and projections
- Computational Complexity
- Computing the Continuous Discretely
- Covering a Three-Dimensional set with Sets of Smaller Diameter
- Discrete tomography: Determination of finite sets by X-rays
- Drei Sätze über die n-dimensionale euklidische Sphäre
- Effective lattice point counting in rational convex polytopes
- Eventual quasi-linearity of the Minkowski length
- Extremal sections and projections of certain convex bodies: a survey
- scientific article; zbMATH DE number 4133027 (Why is no real title available?)
- scientific article; zbMATH DE number 3122841 (Why is no real title available?)
- scientific article; zbMATH DE number 3905351 (Why is no real title available?)
- scientific article; zbMATH DE number 1342145 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- Inequalities for sections and projections of convex bodies
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Integer Polynomial Optimization in Fixed Dimension
- Lattice problems and norm embeddings
- Lattice reduced and complete convex bodies
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- On the classification of toric Fano 4-folds
- On the lattice diameter of a convex polygon
- On the Number of Convex Lattice Polygons
- On the number of convex lattice polytopes
- Polygons as sections of higher-dimensional polytopes
- Polynomial bounds in Koldobsky's discrete slicing problem
- Presburger arithmetic, rational generating functions, and quasi-polynomials
- Projecting lattice polytopes without interior lattice points
- Statistics of integral convex polygons
- Sums, projections, and sections of lattice sets, and the discrete covariogram
- The best ways to slice a polytope
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
This page was built for publication: On lattice diameter segments: algorithms and structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349458)
