An efficient method computes Ehrhart polynomials of Gelfand-Tsetlin polytopes via Ehrhart-Macdonald reciprocity by counting strict patterns at negative dilations with adaptive positive/negative evaluation.
Order , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast computation of Ehrhart polynomials of Gelfand--Tsetlin polytopes via Macdonald reciprocity
An efficient method computes Ehrhart polynomials of Gelfand-Tsetlin polytopes via Ehrhart-Macdonald reciprocity by counting strict patterns at negative dilations with adaptive positive/negative evaluation.