Counting faces of graphical zonotopes

DOI10.26493/1855-3974.1132.FAEzbMATH Open1386.05193arXiv1604.06931OpenAlexW2598641646WikidataQ129358885 ScholiaQ129358885MaRDI QIDQ4597494FDOQ4597494

Authors: Vladimir N. Grujić 

Publication date: 13 December 2017

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

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$.

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

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

zbMATH Keywords

symmetric function\(f\)-vectorgraphical matroidgraphical zonotope

Mathematics Subject Classification ID

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

Cited In (6)

• The kernel of chromatic quasisymmetric functions on graphs and nestohedra
• Counting faces of nestohedra
• Weighted \(\mathsf{P}\)-partitions enumerator
• The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes
• Weighted quasisymmetric enumerator for generalized permutohedra
• Title not available (Why is that?)

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)