Search arXivSearch

arXiv · 2608.13276

A new characterization of right keys, and the $m$-symmetric Schur functions at $t=0$

Abstract

The ring $R_m$ of $m$-symmetric functions consists of the formal power series that are symmetric in the variables $x_{m+1},x_{m+2},\dots$ but carry no symmetry in the first $m$ variables. We develop a combinatorial theory for the specialization at $t=0$ of the Schur functions of $R_m$. Our main tool is a new characterization of right key tableaux as suprema of the sets of decreasing subwords of the reading words of the subtableaux of $T$. Being invariant under elementary Knuth transformations, this characterization is compatible with the RSK correspondence. We obtain in this way a generating function over semistandard tableaux for the $m$-symmetric Schur functions at $t=0$, together with a combinatorial proof of a Cauchy identity in $R_m$. The $m$-symmetric Schur functions and their dual are then respectively identified with Demazure atoms and Demazure characters. Restricted to the last $m$ variables, our correspondence specializes to a proof, by ordinary RSK, of Lascoux's nonsymmetric Cauchy identity for Demazure characters and atoms. As further applications, we relate the $m$-symmetric Schur functions at $t=0$ to the almost symmetric Schur functions through a unitriangular change-of-basis matrix, obtain tableau generating functions and Cauchy identities for both families, and derive Jacobi-Trudi type determinantal formulas for three different bases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luc Lapointe, Luis Pena. 2026-08-13. A new characterization of right keys, and the $m$-symmetric Schur functions at $t=0$. https://arxiv.org/abs/2608.13276

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO