math.CO — Combinatorics
Contributed by Darij Grinberg
The \emph{arithmetic product} ⊡ is a bilinear operation
on the ring of symmetric functions over Q defined by
\[
p_\lambda \ \boxdot\ p_\mu
= \prod_{i,j}p_{\operatorname{lcm}(\lambda_i,\mu_j)}^{\gcd(\lambda_i,\mu_j)}
\]
on the power-sum basis (pλ).
It is known that this operation preserves the subring
SymmZ of symmetric functions with
integer coefficients, and is Schur-positive on pairs of Schur
functions. Indeed, it corresponds to induction of
representations from Sn×Sm to Snm.
In this work, we consider the \emph{anti-arithmetic product}
♢, which is defined by the same formula but with
gcd and lcm interchanged.
We show that it, too, preserves SymmZ,
even though it lacks the Schur positivity property.
This was conjectured on MathOverflow in 2014.
Our method is a more intricate variant of the
representation-theoretical interpretation of ⊡.
The anti-arithmetic product does not correspond to an
operation on actual representations; but its adjoint can still
be described as a map on characters, which (as we show) is a
λ-ring morphism from the character ring of
Smn to that of Sm×Sn.
Now, a 1975 theorem of Boorman shows that the
representation ring of Sn is generated by the natural
permutation representation Mn=Qn as a λ-ring.
Thus, the proof of integrality boils down to only computing
the image of Mmn under this adjoint, which can be done using
M\"obius inversion in the representation ring.
This work is aimed at readers familiar with representation rings
and the representation theory of symmetric groups. No prior
knowledge of λ-rings is presumed.
Three self-contained proofs of Boorman's theorem are given in the
appendices, two of them lifting the theorem to the noncommutative
symmetric functions (or Solomon's descent algebra), recovering
a result of Schocker.
A mix of human-written and AI-generated textHuman understanding: all partsSpecht modulesdescent algebralambda-ringsnoncommutative symmetric functionssymmetric functionssymmetric group representations