English
Related papers

Related papers: Chromatic Quasisymmetric Class Functions for combi…

200 papers

In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of cliques. We consider their graph complements, the functions…

Combinatorics · Mathematics 2021-11-16 Logan Crew , Sophie Spirkl

In [J. Combin. Theory Ser. B 161 (2023), 109--119], the authors showed that the list-color function $P_l(G,k)$ of any simple graph $G$ of size $m$ coincides with its chromatic polynomial $P(G,k)$ for all integers $k\ge m-1$. In this…

Combinatorics · Mathematics 2024-12-11 Fengming Dong , Meiqiao Zhang

The purpose of this paper is twofold. Firstly, we generalize the notion of characteristic polynomials of hyperplane and toric arrangements to those of certain abelian Lie group arrangements. Secondly, we give two interpretations for the…

Combinatorics · Mathematics 2019-12-30 Tan Nhat Tran , Masahiko Yoshinaga

In this paper, we first discuss some properties of the Galois linear maps. We provide some equivalent conditions for Hopf algebras and Hopf (co)quasigroups as its applications. Then let $H$ be a Hopf quasigroup with bijective antipode and…

Quantum Algebra · Mathematics 2019-02-28 Wei Wang , Shuanhong Wang

In 1993, Stanley and Stembridge conjectured that a chromatic symmetric function of any $(3+1)$-free poset is $e$-positive. Guay-Paquet reduced the conjecture to $(3+1)$- and $(2+2)$-free posets which are also called natural unit interval…

Combinatorics · Mathematics 2022-02-15 Seung Jin Lee , Sue Kyong Y. Soh

Recently, Hyatt introduced some colored Eulerian quasisymmetric function to study the joint distribution of excedance number and major index on colored permutation groups. We show how Hyatt's generating function formula for the fixed point…

Combinatorics · Mathematics 2013-10-04 Zhicong Lin

Let $\mathcal{P}$ be a graph property. A $\mathcal{P}$-coloring with at most $k$ colors is a coloring of the vertices of a simple graph $G$ such that each color class induces a graph in $\mathcal{P}$. Harary polynomials are generalizations…

Combinatorics · Mathematics 2025-12-30 Johann A. Makowsky

The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex…

Statistical Mechanics · Physics 2009-10-31 Alan D. Sokal

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics and LLT polynomials. In the, so called, abelian case they are also…

Combinatorics · Mathematics 2023-01-11 Laura Colmenarejo , Alejandro H. Morales , Greta Panova

Aguiar and Ardila defined the Hopf monoid GP of generalized permutahedra and showed that it contains many submonoids that correspond to combinatorial objects. They also give a basic polynomial invariant of generalized permutahedra, which…

Combinatorics · Mathematics 2019-07-29 Keiju Kato

Given a central integral arrangement, the reduction of the arrangement modulo positive integers $q$ gives rise to a subgroup arrangement in $(\mathbb{Z}/q\mathbb{Z})^\ell$. Kamiya-Takemura-Terao (2008) introduced the notion of…

Combinatorics · Mathematics 2020-06-03 Tan Nhat Tran

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Combinatorics · Mathematics 2012-04-06 Eric Babson , Matthias Beck

A $k$-uniform hypergraph $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that every edge in $E$ contains precisely one vertex from each $V_i$. We call such a graph $n$-balanced if $|V_i| = n$ for…

Combinatorics · Mathematics 2024-07-26 Abhishek Dhawan

A smooth hypergraph property $\mathcal{P}$ is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hypergraph but not all hypergraphs. In this paper we examine…

Combinatorics · Mathematics 2018-04-18 Thomas Schweser

A Gallai coloring of the complete graph is an edge-coloring with no rainbow triangle. This concept first appeared in the study of comparability graphs and anti-Ramsey theory. We introduce a transitive analogue for acyclic directed graphs,…

Combinatorics · Mathematics 2023-09-21 R. M. Adin , A. Berenstein , J. Greenstein , J. -R. Li , A. Marmor , Y. Roichman

We prove some Schur positivity results for the chromatic symmetric function $X_G$ of a (hyper)graph $G$, using connections to the group algebra of the symmetric group. The first such connection works for (hyper)forests $F$: we describe the…

Combinatorics · Mathematics 2024-10-29 Brendan Pawlowski

We extend a recent construction concerning polychromatic colorings of hereditary hypergraph families. For every integer $h\ge 4$ we construct a $(2h-1)$-uniform hypergraph which has no polychromatic $3$-coloring, but all of whose $h$-heavy…

Combinatorics · Mathematics 2026-04-28 Dömötör Pálvölgyi

In this paper, we introduce the \emph{$\alpha$-chromatic symmetric functions} $\chi^{(\alpha)}_\pi[X;q]$, extending Shareshian and Wachs' chromatic symmetric functions with an additional real parameter $\alpha$. We present positive…

Combinatorics · Mathematics 2025-04-21 Jim Haglund , Jaeseong Oh , Meesue Yoo

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics, and LLT polynomials. In the case of, so-called, abelian Dyck paths…

Combinatorics · Mathematics 2021-04-22 Laura Colmenarejo , Alejandro H. Morales , Greta Panova

We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…

Combinatorics · Mathematics 2025-06-30 Yichen Ma