Related papers: Chromatic Quasisymmetric Class Functions for combi…
Cho and van Willigenburg (arXiv:1508.07670) and Alinaeifard, Wang, and van Willgenburg (arXiv:2010.00147) introduce multiplicative chromatic bases for the ring $\Lambda$ of symmetric functions, consisting of the chromatic symmetric…
The chromatic symmetric function $X_G$ is a power series that encodes the proper colorings of a graph $G$ by assigning a variable to each color and a monomial to each coloring such that the power of a variable in a monomial is the number of…
Many families of combinatorial objects have a Hopf monoid structure. Aguiar and Ardila introduced the Hopf monoid of generalized permutahedra and showed that it contains various other notable combinatorial families as Hopf submonoids,…
Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…
We introduce a quasisymmetric class function associated with a group acting on a double poset or on a directed graph. The latter is a generalization of the chromatic quasisymmetric function of a digraph introduced by Ellzey, while the…
We construct Hopf algebras whose elements are representations of combinatorial automorphism groups, by generalising a theorem of Zelevinsky on Hopf algebras of representations of wreath products. As an application we attach symmetric…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…
It is known that unicellular LLT polynomials are related to the quasi-symmetric chromatic polynomials of certain graphs by the $(t-1)$-transform of symmetric functions. We investigate the extension of this transformation to various…
Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order…
Shareshian-Wachs, Brosnan-Chow, and Guay-Pacquet [Adv. Math. ${\bf 295}$ (2016), ${\bf 329}$ (2018), arXiv:1601.05498] realized the chromatic (quasi-)symmetric function of a unit interval graph in terms of Hessenberg varieties. Here we…
The quasisymmetric functions, $QSym$, are generalized for a finite alphabet $A$ by the colored quasisymmetric functions, $QSym_A$, in partially commutative variables. Their dual, $NSym_A$, generalizes the noncommutative symmetric functions,…
The chromatic symmetric function $X_G$ of a graph $G$ was introduced by Stanley. In this paper we introduce a quasisymmetric generalization $X^k_G$ called the $k$-chromatic quasisymmetric function of $G$ and show that it is positive in the…
We introduce analogs of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. When the color set is a semigroup, an internal product can be introduced. This leads to the construction of generalized…
By using level one polynomial representations of affine Hecke algebras of type $A$, we obtain a $(q,t)$-analogue of the chromatic symmetric functions of unit interval graphs which generalizes Syu Kato's formula for the chromatic symmetric…
We introduce two coproducts on mixed graphs (that is to say graphs with both oriented and unoriented edges), the first one by separation of the vertices into two parts, and the second one given by contraction and extractions of subgraphs.…
We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $\Gamma\wr\SG_n$ and…
In this paper we use the technique of Hopf algebras and quasi-symmetric functions to study the combinatorial polytopes. Consider the free abelian group $\mathcal{P}$ generated by all combinatorial polytopes. There are two natural bilinear…
The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…
Motivated by a connection between the topology of (generalized) configuration spaces and chromatic polynomials, we show that generating functions of Hodge-Deligne polynomials of quasiprojective varieties and colorings of acyclic directed…