Computing volumes of adjacency polytopes via Draconian sequences

DOI10.37236/9768zbMath1486.52026arXiv2007.11051OpenAlexW3045121045MaRDI QIDQ2121807

Yanyan Li

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.11051

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Enumeration in graph theory (05C30)

Related Items (1)

PQ-type adjacency polytopes of join graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Faces of generalized permutohedra
• Parallel recognition of series-parallel graphs
• The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
• A product formula for the normalized volume of free sums of lattice polytopes
• Permutohedra, Associahedra, and Beyond
• Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index
• Computing the Continuous Discretely

This page was built for publication: Computing volumes of adjacency polytopes via Draconian sequences