The Martin Gardner Polytopes
DOI10.1080/00029890.2020.1751547zbMath1444.05003arXiv1808.08797OpenAlexW3045919081MaRDI QIDQ3304739
Raman Sanyal, Janin Heuer, Nicole Schulz, Kristin Fritsch
Publication date: 3 August 2020
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.08797
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Permutations, words, matrices (05A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressed polytopes and statistical disclosure limitation
- Triangulations. Structures for algorithms and applications
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Ehrhart \(f^*\)-coefficients of polytopal complexes are non-negative integers
- A local Riemann hypothesis. I
- Two enumerative results on cycles of permutations
- Interlacing Ehrhart polynomials of reflexive polytopes
- Lectures on Polytopes
- Combinatorial Reciprocity Theorems
- Computing the Continuous Discretely
This page was built for publication: The Martin Gardner Polytopes