OpenAlex ·
Stability of plethysm coefficients and modified polynomial induction
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.07929
- Original
- Read it at the publisher
- Topics
Abstract
Let $h_n$ denote the complete homogeneous symmetric function of degree $n$, $s_ν$ the Schur function indexed by a partition $ν$, and $\langle\cdot,\cdot\rangle$ the Hall inner product. The plethysm coefficient $\langle h_n[h_m], s_ν\rangle$ is the multiplicity of the Weyl module $W_ν(\mathbb{C}^N)$ in $\mathrm{Sym}^n(\mathrm{Sym}^m(\mathbb{C}^N))$ whenever $ν$ has at most $N$ parts. For a partition $λ$, let $λ[mn]=(mn-|λ|,λ_1,λ_2,\dots)$. Bowman and Paget proved that $\langle h_n[h_m], s_{λ[mn]}\rangle$ is independent of $m$ and $n$ once $m,n\ge|λ|$. We prove that this coefficient is already constant for $m\geλ_1$ and $n\ge\lfloor(|λ|+λ_1)/2\rfloor$, and that its stable value equals $\langle s_λ, H[H-1-h_1]\rangle$, where $H=\sum_{i\ge0}h_i$; the proof uses the skewing operators adjoint to multiplication by complete homogeneous symmetric functions. We give a short new proof of the Bowman-Paget theorem based on stability of vector-partition functions, which count the ways of writing a vector of non-negative integers as an unordered sum of non-zero such vectors (its parts). Using a Vandermonde-type determinantal identity, we deduce that the stable value is a signed sum of numbers of vector partitions all of whose parts have entries summing to at least 2. The same method gives a short proof of Brion's stability theorem. We show that the stable value equals the multiplicity of $W_λ(\mathbb{C}^k)$, where $k=\lfloor|λ|/2\rfloor$, in an explicit representation of $GL_k(\mathbb{C})$ independent of $m$ and $n$, obtained by modifying the polynomial induction of Narayanan, Paul, Prasad and Srivastava. Finally, we prove an explicit positive formula for the stable value, which counts the number of lattice points in a polytope, when $λ_1\le 4$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Mathematical Physics
Perfect state transfer on mixed graphs: complete classes and transfer times
A deterministic algorithm for signing bipartite graphs at the Ramanujan bound
On the complexity of the single-move labeled token routing problem
Moment Methods for Uniform Average Mixing on Strongly Regular Graphs
Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
Get the few papers worth your time in Mathematical Physics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.