Search arXivSearch

arXiv · 2503.19323

Invariant theory for wreath products acting on superpolynomials

Abstract

This paper considers a finite group $G$ acting linearly on the variables $V$ of a polynomial algebra, or an exterior algebra, or superpolynomial algebra with both commuting and anticommuting variables. In this setting, the Hilbert series for the $G$-invariant subalgebra turns out to determine the analogous Hilbert series for the wreath product $P[G]$ acting on $V^n$ for any permutation group $P$ inside the symmetric group $S_n$ on $n$ letters. This leads to a structural result: one can collate the direct sum for all $n$ of the $S_n[G]$-invariant subalgebras to form a graded ring via an external shuffle product, whose structure turns out to be a superpolynomial algebra generated by the $G$-invariants. A parallel statement holds for the direct sum of all $S_n[G]$-antiinvariants, which forms a graded ring via an external signed shuffle product, isomorphic to the superexterior algebra generated by the $G$-invariants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Trevor Karn, Victor Reiner. 2025-06-10. Invariant theory for wreath products acting on superpolynomials. https://arxiv.org/abs/2503.19323

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