2018
DOI: 10.1016/j.aam.2018.06.003
|View full text |Cite
|
Sign up to set email alerts
|

Detecting the integer decomposition property and Ehrhart unimodality in reflexive simplices

Abstract: A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) h * -polynomial. This conjecture can be viewed as a strengthening of a previously disproved conjecture which stated that any Gorenstein lattice polytope has a unimodal h * -polynomial. The first counterexamples to unimodality for Gorenstein lattice polytopes were given in even dimensions greater than five by Mustaţǎ and Payne, and this was extended t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
52
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

3
3

Authors

Journals

citations
Cited by 20 publications
(52 citation statements)
references
References 13 publications
0
52
0
Order By: Relevance
“…then we see by the decomposed presentation of f (4,3) in the third equality that f 3,0 (4,3) = 1 + 10z + 10z 2 + z 3 , f 3,1 (4,3) = 3 + 12z + 6z 2 , and f 3,2 (4,3) = 6 + 12z + 3z 2 . Then, by Theorem 4.2, we know that h * (B (4,3) ; z) = (1 + 10z + 10z 2 + z 3 ) + z(9 + 24z + 9z 2 ),…”
Section: 2mentioning
confidence: 99%
See 4 more Smart Citations
“…then we see by the decomposed presentation of f (4,3) in the third equality that f 3,0 (4,3) = 1 + 10z + 10z 2 + z 3 , f 3,1 (4,3) = 3 + 12z + 6z 2 , and f 3,2 (4,3) = 6 + 12z + 3z 2 . Then, by Theorem 4.2, we know that h * (B (4,3) ; z) = (1 + 10z + 10z 2 + z 3 ) + z(9 + 24z + 9z 2 ),…”
Section: 2mentioning
confidence: 99%
“…Moreover, it turns out the h * -polynomial of this n-simplex can be computed in a recursive fashion in terms of the numeral representations of the first a n nonnegative integers. This recursive formula is presented in Proposition 3.2, but it is essentially due to the following theorem of [4].…”
Section: Reflexive Numeral Systemsmentioning
confidence: 99%
See 3 more Smart Citations