The Frobenius transform of a symmetric function

Abstract

We define an abelian group homomorphism F, which we call the Frobenius transform, from the ring of symmetric functions to the ring of the symmetric power series. The matrix entries of F in the Schur basis are the restriction coefficients rλμ = HomSn(Vμ, Sλ Cn), which are known to be nonnegative integers but have no known combinatorial interpretation. The Frobenius transform satisfies the identity F\fg\ = F\f\ F\g\, where is the Kronecker product. We prove for all symmetric functions f that F\f\ = FSur\f\ · (1 + h1 + h2 + ·s), where FSur\f\ is a symmetric function with the same degree and leading term as f. Then, we compute the matrix entries of FSur\f\ in the complete homogeneous, elementary, and power sum bases and of F-1Sur\f\ in the complete homogeneous and elementary bases, giving combinatorial interpretations of the coefficients where possible. In particular, the matrix entries of F-1Sur\f\ in the elementary basis count words with a constraint on their Lyndon factorization. As an example application of our main results, we prove that rλμ = 0 if |λ μ| < 2|μ| - |λ|, where μ is the partition formed by removing the first part of μ. We also prove that rλμ = 0 if the Young diagram of μ contains a square of side length greater than 2λ1 - 1, and this inequality is tight.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…