Smooth Fano polytopes whose Ehrhart polynomial has a root with large real part
The symmetric edge polytopes of odd cycles (del Pezzo polytopes) are known as smooth Fano polytopes. In this extended abstract, we show that if the length of the cycle is 127, then the Ehrhart polynomial has a root whose real part is greater than the dimension. As a result, we have a smooth Fano pol...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | Hidefumi Ohsugi, Kazuki Shibata |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2012-01-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/3041/pdf |
Similar Items
On a Classification of Smooth Fano Polytopes
by: Benjamin Assarf, et al.
Published: (2013-01-01)
by: Benjamin Assarf, et al.
Published: (2013-01-01)
Classification of Ehrhart polynomials of integral simplices
by: Akihiro Higashitani
Published: (2012-01-01)
by: Akihiro Higashitani
Published: (2012-01-01)
Ehrhart Positivity for Generalized Permutohedra
by: Federico Castillo, et al.
Published: (2015-01-01)
by: Federico Castillo, et al.
Published: (2015-01-01)
Ehrhart $h^*$-vectors of hypersimplices
by: Nan Li
Published: (2013-01-01)
by: Nan Li
Published: (2013-01-01)
Perturbation of transportation polytopes
by: Fu Liu
Published: (2012-01-01)
by: Fu Liu
Published: (2012-01-01)
Cayley and Tutte polytopes
by: Matjaž Konvalinka, et al.
Published: (2012-01-01)
by: Matjaž Konvalinka, et al.
Published: (2012-01-01)
Permutation Polytopes of Cyclic Groups
by: Barbara Baumeister, et al.
Published: (2012-01-01)
by: Barbara Baumeister, et al.
Published: (2012-01-01)
The polytope of Tesler matrices
by: Karola Mészáros, et al.
Published: (2015-01-01)
by: Karola Mészáros, et al.
Published: (2015-01-01)
Polynomial-time normalizers
by: Eugene M. Luks, et al.
Published: (2011-12-01)
by: Eugene M. Luks, et al.
Published: (2011-12-01)
Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01)
by: Anne Lacroix, et al.
Published: (2013-01-01)
On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)
by: Peter Pal Pach, et al.
Published: (2011-11-01)
Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)
Constructing neighborly polytopes and oriented matroids
by: Arnau Padrol
Published: (2012-01-01)
by: Arnau Padrol
Published: (2012-01-01)
Flow polytopes and the Kostant partition function
by: Karola Mészáros, et al.
Published: (2012-01-01)
by: Karola Mészáros, et al.
Published: (2012-01-01)
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)
by: Yury Person, et al.
Published: (2011-05-01)
Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)
by: Helmut Prodinger
Published: (2011-08-01)
Triangulations of cyclic polytopes
by: Steffen Oppermann, et al.
Published: (2012-01-01)
by: Steffen Oppermann, et al.
Published: (2012-01-01)
BERGMAN under MS-DOS and Anick's resolution
by: S. Cojocaru, et al.
Published: (1997-01-01)
by: S. Cojocaru, et al.
Published: (1997-01-01)
The unreasonable ubiquitousness of quasi-polynomials
by: Kevin Woods
Published: (2013-01-01)
by: Kevin Woods
Published: (2013-01-01)
Properties of the extremal infinite smooth words
by: Srečko Brlek, et al.
Published: (2007-01-01)
by: Srečko Brlek, et al.
Published: (2007-01-01)
The Eulerian distribution on centrosymmetric involutions
by: Marilena Barnabei, et al.
Published: (2009-01-01)
by: Marilena Barnabei, et al.
Published: (2009-01-01)
Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)
Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)
by: Fabio Burderi, et al.
Published: (2007-01-01)
Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)
by: Vesa Halava, et al.
Published: (2008-01-01)
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)
by: Gregory Nuel
Published: (2008-01-01)
On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)
by: Jing Kong, et al.
Published: (2009-01-01)
Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)
by: Dorota Bród, et al.
Published: (2008-01-01)
Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)
by: David R. Wood
Published: (2008-01-01)
Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)
by: Petra Kocábová, et al.
Published: (2007-01-01)
Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)
Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)
by: Vincent Vajnovszki
Published: (2007-01-01)
The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)
by: Charlotte Brennan, et al.
Published: (2009-01-01)
On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)
by: Marina Groshaus, et al.
Published: (2008-01-01)
On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)
by: Deshi Ye, et al.
Published: (2009-01-01)
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)
by: Valerie Berthe, et al.
Published: (2009-03-01)
Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)
by: Sergey Kitaev, et al.
Published: (2008-01-01)
A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)
by: David Callan
Published: (2008-01-01)
The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)
by: José Cáceres, et al.
Published: (2013-01-01)
List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)
by: Aijun Dong, et al.
Published: (2013-03-01)
Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)
Similar Items
-
On a Classification of Smooth Fano Polytopes
by: Benjamin Assarf, et al.
Published: (2013-01-01) -
Classification of Ehrhart polynomials of integral simplices
by: Akihiro Higashitani
Published: (2012-01-01) -
Ehrhart Positivity for Generalized Permutohedra
by: Federico Castillo, et al.
Published: (2015-01-01) -
Ehrhart $h^*$-vectors of hypersimplices
by: Nan Li
Published: (2013-01-01) -
Perturbation of transportation polytopes
by: Fu Liu
Published: (2012-01-01)
