The Frobenius transform of a symmetric function
Abstract
We define an abelian group homomorphism , which we call the Frobenius transform, from the ring of symmetric functions to the ring of the symmetric power series. The matrix entries of in the Schur basis are the restriction coefficients , which are known to be nonnegative integers but have no known combinatorial interpretation. The Frobenius transform satisfies the identity , where is the Kronecker product. We prove for all symmetric functions that , where is a symmetric function with the same degree and leading term as . Then, we compute the matrix entries of in the complete homogeneous, elementary, and power sum bases and of in the complete homogeneous and elementary bases, giving combinatorial interpretations of the coefficients where possible. In particular, the matrix entries of in the elementary basis count words with a constraint on their Lyndon factorization. As an example application of our main results, we prove that if , where is the partition formed by removing the first part of . We also prove that if the Young diagram of contains a square of side length greater than , and this inequality is tight.
Cite
@article{arxiv.2307.06678,
title = {The Frobenius transform of a symmetric function},
author = {Mitchell Lee},
journal= {arXiv preprint arXiv:2307.06678},
year = {2024}
}
Comments
31 pages