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...

書目詳細資料
發表在:	Discrete Mathematics & Theoretical Computer Science
Main Authors:	Hidefumi Ohsugi, Kazuki Shibata
格式:	Article
語言:	英语
出版:	Discrete Mathematics & Theoretical Computer Science 2012-01-01
主題:	ehrhart polynomials grôbner bases gorenstein fano polytopes. [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
在線閱讀:	https://dmtcs.episciences.org/3041/pdf

相似書籍

On a Classification of Smooth Fano Polytopes
由: Benjamin Assarf, et al.
出版: (2013-01-01)

Classification of Ehrhart polynomials of integral simplices
由: Akihiro Higashitani
出版: (2012-01-01)

Ehrhart Positivity for Generalized Permutohedra
由: Federico Castillo, et al.
出版: (2015-01-01)

Ehrhart $h^*$-vectors of hypersimplices
由: Nan Li
出版: (2013-01-01)

Perturbation of transportation polytopes
由: Fu Liu
出版: (2012-01-01)

Cayley and Tutte polytopes
由: Matjaž Konvalinka, et al.
出版: (2012-01-01)

Permutation Polytopes of Cyclic Groups
由: Barbara Baumeister, et al.
出版: (2012-01-01)

The polytope of Tesler matrices
由: Karola Mészáros, et al.
出版: (2015-01-01)

Polynomial-time normalizers
由: Eugene M. Luks, et al.
出版: (2011-12-01)

Automaticity of primitive words and irreducible polynomials
由: Anne Lacroix, et al.
出版: (2013-01-01)

On the minimal distance of a polynomial code
由: Peter Pal Pach, et al.
出版: (2011-11-01)

Recursions and divisibility properties for combinatorial Macdonald polynomials
由: Nicholas A. Loehr, et al.
出版: (2011-02-01)

Constructing neighborly polytopes and oriented matroids
由: Arnau Padrol
出版: (2012-01-01)

Flow polytopes and the Kostant partition function
由: Karola Mészáros, et al.
出版: (2012-01-01)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
由: Yury Person, et al.
出版: (2011-05-01)

Digital search trees with m trees: Level polynomials and insertion costs
由: Helmut Prodinger
出版: (2011-08-01)

Triangulations of cyclic polytopes
由: Steffen Oppermann, et al.
出版: (2012-01-01)

BERGMAN under MS-DOS and Anick's resolution
由: S. Cojocaru, et al.
出版: (1997-01-01)

The unreasonable ubiquitousness of quasi-polynomials
由: Kevin Woods
出版: (2013-01-01)

Properties of the extremal infinite smooth words
由: Srečko Brlek, et al.
出版: (2007-01-01)

The Eulerian distribution on centrosymmetric involutions
由: Marilena Barnabei, et al.
出版: (2009-01-01)

Number of connected spanning subgraphs on the Sierpinski gasket
由: Shu-Chiuan Chang, et al.
出版: (2009-01-01)

Coding partitions
由: Fabio Burderi, et al.
出版: (2007-01-01)

Interaction properties of relational periods
由: Vesa Halava, et al.
出版: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
由: Gregory Nuel
出版: (2008-01-01)

On economical set representations of graphs
由: Jing Kong, et al.
出版: (2009-01-01)

Recurrence among trees with most numerous efficient dominating sets
由: Dorota Bród, et al.
出版: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
由: David R. Wood
出版: (2008-01-01)

Ambiguity in the m-bonacci numeration system
由: Petra Kocábová, et al.
出版: (2007-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
由: Khodabakhsh Hessami Pilehrood, et al.
出版: (2008-01-01)

Gray code order for Lyndon words
由: Vincent Vajnovszki
出版: (2007-01-01)

The distribution of ascents of size d or more in compositions
由: Charlotte Brennan, et al.
出版: (2009-01-01)

On hereditary Helly classes of graphs
由: Marina Groshaus, et al.
出版: (2008-01-01)

On-line extensible bin packing with unequal bin sizes
由: Deshi Ye, et al.
出版: (2009-01-01)

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
由: Valerie Berthe, et al.
出版: (2009-03-01)

Counting descents, rises, and levels, with prescribed first element, in words
由: Sergey Kitaev, et al.
出版: (2008-01-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
由: David Callan
出版: (2008-01-01)

The determining number of Kneser graphs
由: José Cáceres, et al.
出版: (2013-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
由: Aijun Dong, et al.
出版: (2013-03-01)

Immersion containment and connectivity in color-critical graphs
由: Faisal N. Abu-Khzam, et al.
出版: (2012-10-01)