Search arXivSearch

arXiv · 2602.12623

Plethysm and orbit harmonics

Abstract

Let $Π_{(b^a)}$ be the locus of unordered set partitions of $[ab]$ with $a$ blocks of size $b$. We embed unordered set partitions of $[n]$ into the affine space $\mathbb{C}^{\binom{[n]}{2}}$ with coordinate ring $\mathbb{C}\Big[\mathbf{x}_{\binom{[n]}{2}}\Big]$. Then, we apply orbit harmonics to $Π_{(2^a)}$ and $Π_{(a^2)}$, yielding graded $\mathfrak{S}_{2a}$-modules whose graded character formulae respectively refine the Schur expansions of $h_a[h_2]$ and $h_2[h_a]$ according to $λ_1$. We further extend this $λ_1$-separation phenomenon to quotients of $\mathbb{C}^{\binom{[n]}{2}}$ where $n$ is odd. Combining $Π_{(b^a)},Π_{(a^b)}$ and orbit harmonics, we propose a conjecture related to Foulkes' conjecture, and we prove the special case $b=2$. We also apply orbit harmonics to the locus $Π_{n,m}$ of unordered set partitions of $[n]$ without blocks of size greater than $m$, yielding a graded $\mathfrak{S}_n$-module $R(Π_{n,m})$. We determine the standard monomial basis of $R(Π_{n,m})$ with respect to any monomial order, as well as its graded character formula.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hai Zhu. 2026-02-13. Plethysm and orbit harmonics. https://arxiv.org/abs/2602.12623

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