Roots of Ehrhart polynomials arising from graphs
- 4 May 2011
- journal article
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 34 (4) , 721-749
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Gale duality bounds for roots of polynomials with nonnegative coefficientsJournal of Combinatorial Theory, Series A, 2010
- Norm Bounds for Ehrhart Polynomial RootsDiscrete & Computational Geometry, 2008
- Ehrhart polynomial roots and Stanley’s non-negativity theorem2008
- Notes on the Roots of Ehrhart PolynomialsDiscrete & Computational Geometry, 2007
- Ehrhart Polynomials and Successive MinimaMathematika, 2005
- Coefficients and roots of Ehrhart polynomials2005
- Normal Polytopes Arising from Finite GraphsJournal of Algebra, 1998
- A Lower Bound Theorem for Ehrhart Polynomials of Convex PolytopesAdvances in Mathematics, 1994
- A Monotonicity Property of h-vectors and h*-vectorsEuropean Journal of Combinatorics, 1993
- Note dual polytopes of rational convex polytopesCombinatorica, 1992