Search arXivSearch

arXiv · 2609.10284

Jack Content Operators and the Deformed ${\mathcal W}_{1+\infty}$ Algebra

Abstract

Frenkel and Wang obtained a representation of the Virasoro algebra by commuting Goulden's cut-and-join operator with the Heisenberg generators. A vertex-operator construction by Lascoux and the author extends this representation to $\mathcal W_{1+\infty}$ by means of differential operators whose eigenvalues are the power sums of the contents of a Young diagram. We develop a Jack deformation in the spherical degenerate double affine Hecke algebra and its stable limit. Starting from the Heckman--Polychronakos integrals, we isolate operators whose eigenvalues are the power sums of the $α$-contents. Because the Goulden--Jackson product is defined in the convention dual to the usual Calogero--Sutherland Hamiltonians, the multiplication operators $Δ_μ(α)$ are obtained by taking Hall adjoints. This gives conceptual derivations of the Jack cut-and-join operator and of the stable $3$-cycle operator. A normal-ordering construction due to Sergeev and Veselov makes the latter calculation explicit and suggests an integral form over $\mathbb Z[α]$. The commutators of the cut-and-join operator contain one half of the usual Feigin--Fuchs realization, but this Virasoro completion is not the deformation of the Frenkel--Wang construction. The latter takes place in the deformed $\mathcal W_{1+\infty}$ algebra $\mathbf{SH}^c$, equivalently in the affine Yangian of $\mathfrak{gl}_1$: in our normalization its first nontrivial Cartan mode is $ψ_3=3Δ_2(α)+2(α-1)E$, and its commutators with the first raising and lowering modes recursively generate the remaining currents. At $α=1$ these relations specialize to the central-charge-one $\mathcal W_{1+\infty}$ representation used by Lascoux and the author.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Yves Thibon. 2026-09-09. Jack Content Operators and the Deformed ${\mathcal W}_{1+\infty}$ Algebra. https://arxiv.org/abs/2609.10284

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