Search arXivSearch

arXiv · 2501.07573

Symmetry of ascent and descent distributions on rectangular and staircase tableaux

Abstract

We give direct bijective proofs of the symmetry of the distributions of the number of ascents and descents over standard Young tableaux of shape $λ$, where $λ$ is a rectangle $(n,n,\dots,n)$ or a truncated staircase $(n,n-1,\dots,n-k+1)$. These can be viewed as instances of the more general symmetry of the distribution of descents over linear extensions of graded posets, for which previous proofs by Stanley and Farley were based on the theory of $P$-partitions and the involution principle, respectively. In the case of two-row rectangles $(n,n)$, our bijection is equivalent to the Lalanne--Kreweras involution on Dyck paths, which bijectively proves the symmetry of the Narayana numbers. Our bijections are defined in terms of certain arrow encodings of standard Young tableaux. This setup allows us to construct other statistic-preserving involutions on tableaux of rectangular shape, providing a simple proof of the fact that ascents and descents are equidistributed up to a shift, and proving a conjecture of Sulanke about certain statistics in the case of three rows. Finally, we use our bijections to define a possible notion of rowmotion on standard Young tableaux of rectangular shape, and to give a bijective proof of the symmetry of the number of descents on canon permutations, which have been recently studied as a variation of Stirling and quasi-Stirling permutations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergi Elizalde. 2025-03-13. Symmetry of ascent and descent distributions on rectangular and staircase tableaux. https://arxiv.org/abs/2501.07573

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