Search arXivSearch

arXiv · 2307.06678

The Frobenius transform of a symmetric function

Abstract

We define an abelian group homomorphism $\mathscr{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 $\mathscr{F}$ in the Schur basis are the restriction coefficients $r_λ^μ= \dim \operatorname{Hom}_{\mathfrak{S}_n}(V_μ, \mathbb{S}^λ\mathbb{C}^n)$, which are known to be nonnegative integers but have no known combinatorial interpretation. The Frobenius transform satisfies the identity $\mathscr{F}\{fg\} = \mathscr{F}\{f\} \ast \mathscr{F}\{g\}$, where $\ast$ is the Kronecker product. We prove for all symmetric functions $f$ that $\mathscr{F}\{f\} = \mathscr{F}_{\mathrm{Sur}}\{f\} \cdot (1 + h_1 + h_2 + \cdots)$, where $\mathscr{F}_{\mathrm{Sur}}\{f\}$ is a symmetric function with the same degree and leading term as $f$. Then, we compute the matrix entries of $\mathscr{F}_{\mathrm{Sur}}\{f\}$ in the complete homogeneous, elementary, and power sum bases and of $\mathscr{F}^{-1}_{\mathrm{Sur}}\{f\}$ in the complete homogeneous and elementary bases, giving combinatorial interpretations of the coefficients where possible. In particular, the matrix entries of $\mathscr{F}^{-1}_{\mathrm{Sur}}\{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 $|λ\cap \hatμ| < 2|\hatμ| - |λ|$, where $\hatμ$ 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mitchell Lee. 2024-06-25. The Frobenius transform of a symmetric function. https://arxiv.org/abs/2307.06678

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO