Search arXivSearch

arXiv · 2502.09072

Noncommutative chromatic quasi-symmetric functions, Macdonald polynomials, and the Yang-Baxter equation

Abstract

As shown in our paper [JCTA 177 (2021), Paper No. 105305], the chromatic quasi-symmetric function of Shareshian-Wachs can be lifted to ${\bf WQSym}$, the algebra of quasi-symmetric functions in noncommuting variables. We investigate here its behaviour with respect to classical transformations of alphabets and propose a noncommutative analogue of Macdonald polynomials compatible with a noncommutative version of the Haglund-Wilson formula. We also introduce a multi-$t$ version of these noncommutative analogues. For rectangular partitions, their commutative images at $q=0$ appear to coincide with the multi-$t$ Hall-Littlewood functions introduced in [Lett. Math. Phys. 35 (1995), 359]. This leads us to conjecture that for rectangular partitions, multi-$t$ Macdonald polynomials are obtained as equivariant traces of certain Yang-Baxter elements of Hecke algebras. We also conjecture that all (ordinary) Macdonald polynomials can be obtained in this way. We conclude with some remarks relating various aspects of quasi-symmetric chromatic functions to calculations in Hecke algebras. In particular, we show that all modular relations are given by the product formula of the Kazhdan-Lusztig basis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Christophe Novelli, Jean-Yves Thibon. 2025-11-04. Noncommutative chromatic quasi-symmetric functions, Macdonald polynomials, and the Yang-Baxter equation. https://arxiv.org/abs/2502.09072

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO