Search arXivSearch

arXiv · 2608.30791

Shifted Macdonald Polynomials and the $(q,t)$-Deformed Goulden--Jackson Product

Abstract

In a preceding article, we introduced stable symmetric series encoding simultaneously the normalized conjugacy classes of all symmetric groups. The same rational series remain stable for the Jack-deformed Goulden--Jackson product. We investigate their two-parameter Macdonald analogue. Starting from the $(q,t)$-deformed class product (dual to the coproduct diagonal on the $J$-basis), we construct the unique infinite series whose multiplication realizes any shifted Macdonald eigenvalue. In contrast with the classical and Jack cases, this transform is no longer multiplication by a fixed explicit series. We identify it with a composition of a Cauchy multiplication, the integral nabla operator, and a simple diagonal operator. We then determine the series realizing the Nazarov--Sklyanin operators $A^{(k)}$, derive a single generating series for all column partitions, and compare our construction with the Macdonald characters and Theta operators of Ben Dali and D'Adderio.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Yves Thibon. 2026-08-31. Shifted Macdonald Polynomials and the $(q,t)$-Deformed Goulden--Jackson Product. https://arxiv.org/abs/2608.30791

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