Search arXivSearch

arXiv · 2502.08738

Multi-Symmetric Schur Functions

Abstract

We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are defined as certain stable-limits of key polynomials. We prove combinatorial results about the monomial expansions of the multi-symmetric Schur functions including a diagrammatic combinatorial formula and a triangularity result which completely characterizes their monomial multi-symmetric supports. The triangularity result involves a non-trivial generalization of the dominance order on partitions to tuples of partitions. We prove, using the Demazure character formula, that the multi-symmetric Schur functions expand positively into the basis of tensor products of ordinary Schur functions and describe the expansion coefficients as multiplicities of certain irreducible representations for Levi subgroups inside particular Demazure modules. Lastly, we find a family of multi-symmetric plethystic operators related to the classical Bernstein operators which act on the multi-symmetric Schur basis by a simple recurrence relation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milo Bechtloff Weising. 2025-09-21. Multi-Symmetric Schur Functions. https://arxiv.org/abs/2502.08738

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