Counting integer points in polytopes associated with directed graphs

DOI10.1016/J.AAM.2016.04.008MaRDI QIDQ288998zbMATH OpenOpenAlexWikidataFDO

Authors Ilse Fischer

Publication date 27 May 2016

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2016.04.008

zbMATH Keywords

order polytopesEhrhart theoryGelfand-Tsetlin patternsinteger points in polytopes

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Polytopes and polyhedra (52B99)

Recommendations

• Gelfand-Tsetlin polytopes: a story of flow and order polytopes
• Counting vertices in Gelfand-Zetlin polytopes
• Integer points enumerator of hypergraphic polytopes
• Inside-out polytopes
• Counting integer points in higher-dimensional polytopes

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 3056353 (Why is no real title available?)
• Gelfand-Tsetlin polytopes and Feigin-Fourier-Littelmann-Vinberg polytopes as marked poset polytopes
• On some polynomials enumerating fully packed loop configurations
• Representations of polytopes and polyhedral sets
• The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
• Two poset polytopes

Cited in

(3)

• Counting integer points of flow polytopes
• Counting integer points in higher-dimensional polytopes
• Inside-out polytopes

This page was built for publication: Counting integer points in polytopes associated with directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288998)