The Frobenius transform of a symmetric function

arXiv2307.06678MaRDI QIDQ6511064FDOQ6511064

Authors: Mitchell Lee 

Abstract: We define an abelian group homomorphism $mathscrF$, which we call the Frobenius transform, from the ring of symmetric functions to the ring of the symmetric power series. The matrix entries of $mathscrF$ in the Schur basis are the restriction coefficients $r_{l}ambd{a}^{m}u=dimoperatorname{Hom}_{mathfrak{S}_n}(V_{m}u,mathbb{S}^{l}ambdamathbb{C}^n)$, which are known to be nonnegative integers but have no known combinatorial interpretation. The Frobenius transform satisfies the identity $mathscrFfg=mathscrFfastmathscrFg$, where $ast$ is the Kronecker product. We prove for all symmetric functions $f$ that $mathscrFf=mathscr{F}_{mathrmSur}fcdot(1+h_1+h_2+cdots)$, where $mathscr{F}_{mathrmSur}f$ is a symmetric function with the same degree and leading term as $f$. Then, we compute the matrix entries of $mathscr{F}_{mathrmSur}f$ and $mathscr{F}_{mathrmSur}^{-1}f$ in the complete homogeneous, elementary, and power sum symmetric function bases, giving combinatorial interpretations of the coefficients where possible. In particular, the matrix entries of $mathscr{F}_{mathrmSur}^{-1}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_{l}ambd{a}^{m}u=0$ if the Young diagram of $mu$ contains a square of side length greater than $2^{lambd{a}_1-1}$, and this inequality is tight.

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

This page was built for publication: The Frobenius transform of a symmetric function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6511064)