Search arXivSearch

arXiv · 1811.10687

Composition Tableaux basis for Schur functors and the Plücker algebra

Abstract

We show that combinatorial objects called row-strict composition tableaux, introduced by Mason and Remmel in 2014 and closely related to the quasi-symmetric Schur functions of Haglund-Luoto-Mason-van Willigenburg, form a basis for Schur functors of finite free modules over arbitrary commutative rings. When the ring is the complex numbers, this produces a new basis for the irreducible polynomial representations of $\operatorname{GL}_n(\mathbb{C})$. Moreover, in this case it also produces new basis for the Plücker algebra, a subalgebra of the polynomial ring over $\mathbb{C}$ in $n^2$ variables, which is of independent combinatorial and geometric interests. As an aside we also show that these results hold for other combinatorial objects called reverse row strict tableau.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shubhankar Sahai. 2021-01-12. Composition Tableaux basis for Schur functors and the Plücker algebra. https://arxiv.org/abs/1811.10687

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