Search arXivSearch

arXiv · 2503.23597

$(q,t)$-chromatic symmetric functions

Abstract

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 functions of unit interval graphs. We show that at $q=1$, the $(q,t)$-chromatic symmetric functions essentially reduce to the chromatic quasisymmetric functions defined by Shareshian-Wachs, which in particular gives an algebraic proof of Kato's formula. We also give an explicit formula of the $(q,t)$-chromatic symmetric functions at $q=\infty$, which leads to a probability theoretic interpretation of $e$-expansion coefficients of chromatic quasisymmetric functions used in our proof of the Stanley-Stembridge conjecture. Moreover, we observe that the $(q,t)$-chromatic symmetric functions are multiplicative with respect to certain deformed multiplication on the ring of symmetric functions. We give a simple description of such multiplication in terms of the affine Hecke algebras of type $A$. We also obtain a recipe to produce $(q,t)$-chromatic symmetric functions from chromatic quasisymmetric functions, which actually makes sense for any oriented graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tatsuyuki Hikita. 2025-03-30. $(q,t)$-chromatic symmetric functions. https://arxiv.org/abs/2503.23597

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO