Counting faces of graphical zonotopes

DOI10.26493/1855-3974.1132.FAEMaRDI QIDQ4597494zbMATH OpenOpenAlexWikidataFDO

Authors Vladimir N. Grujić

Publication date 13 December 2017

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

\(f\)-vectorgraphical matroidgraphical zonotopesymmetric function

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Hopf algebras and their applications (16T05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Abstract: It is a classical fact that the number of vertices of the graphical zonotope $Z_{G}amma$ is equal to the number of acyclic orientations of a graph $Gamma$. We show that the $f$-polynomial of $Z_{G}amma$ is obtained as the principal specialization of the $q$-analog of the chromatic symmetric function of $Gamma$.

Recommendations

• scientific article; zbMATH DE number 17664
• Zeros of graph-counting polynomials
• Between graphical zonotope and graph-associahedron
• Acyclic orientations and the chromatic polynomial
• Graph coloring and monotone functions on posets

Cited in

(6)

• Counting faces of nestohedra
• Weighted quasisymmetric enumerator for generalized permutohedra
• The kernel of chromatic quasisymmetric functions on graphs and nestohedra
• Weighted \(\mathsf{P}\)-partitions enumerator
• scientific article; zbMATH DE number 17664 (Why is no real title available?)
• The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes

This page was built for publication: Counting faces of graphical zonotopes

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