Euler characteristic reciprocity for chromatic, flow and order polynomials

DOI10.5427/JSING.2017.16KMaRDI QIDQ4597232zbMATH OpenOpenAlexFDO

Authors Takahiro Hasebe, Toshinori Miyatani, Masahiko Yoshinaga

Publication date 12 December 2017

Published in Journal of Singularitiesl (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial reciprocity theoremrational generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07)

Abstract: The Euler characteristic of a semialgebraic set can be considered as a generalization of the cardinality of a finite set. An advantage of semialgebraic sets is that we can define "negative sets" to be the sets with negative Euler characteristics. Applying this idea to posets, we introduce the notion of semialgebraic posets. Using "negative posets", we establish Stanley's reciprocity theorems for order polynomials at the level of Euler characteristics. We also formulate the Euler characteristic reciprocities for chromatic and flow polynomials.

Recommendations

• On semi-Eulerian partially ordered sets with boundary.
• Euler characteristics and chromatic polynomials
• Combinatorial Reciprocity Theorems
• A bivariate chromatic polynomial for signed graphs
• Ehrhart theory, modular flow reciprocity, and the Tutte polynomial

Cited in

(3)

• What is \(-Q\) for a poset \(Q\)?
• On semi-Eulerian partially ordered sets with boundary.
• Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs

This page was built for publication: Euler characteristic reciprocity for chromatic, flow and order polynomials

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