The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes
From MaRDI portal
Publication:491756
DOI10.1016/j.ejc.2015.03.024zbMath1323.52007arXiv1209.5712OpenAlexW1986141619MaRDI QIDQ491756
Publication date: 19 August 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5712
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Other designs, configurations (05B30)
Related Items
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem, On sumsets and convex hull, The mixed degree of families of lattice polytopes
Cites Work
- On the generalized lower bound conjecture for polytopes and spheres
- Many neighborly polytopes and oriented matroids
- Lattice polytopes having \(h^*\)-polynomials with given degree and linear coefficient
- Totally splittable polytopes
- Triangulations. Structures for algorithms and applications
- The number of faces of a simplicial convex polytope
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- Equidecomposable and weakly neighborly polytopes
- Computing the Ehrhart polynomial of a convex lattice polytope
- The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
- The Radon-split and the Helly-core of a point configuration
- Triangulations of simplicial polytopes
- A simple combinatorial criterion for projective toric manifolds with dual defect
- Polyhedral adjunction theory
- On sumsets and convex hull
- A Helly-number for k-almost-neighborly sets
- Triangulations of oriented matroids
- On the Volume of Lattice Polyhedra
- Cayley decompositions of lattice polytopes and upper bounds for h*-polynomials
- Computing the Continuous Discretely
- Subdivisions and Local h-Vectors
- The m-core properly contains the m-divisible points in space
- Decompositions of Rational Convex Polytopes
- Lectures on Polytopes
- Convex Polytopes
- Lawrence Polytopes
- A generalized lower‐bound conjecture for simplicial polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item