English
Related papers

Related papers: Equidistribution of set-valued statistics on stand…

200 papers

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…

Combinatorics · Mathematics 2014-10-21 Nihal Gowravaram , Ravi Jagadeesan

We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…

Combinatorics · Mathematics 2007-05-23 Jim Haglund , Laura Stevens

The notion of a barely set-valued semistandard Young tableau was introduced by Reiner, Tenner and Yong in their study of the probability distribution of edges in the Young lattice of partitions. Given a partition $\lambda$ and a positive…

Combinatorics · Mathematics 2018-07-24 Neil J. Y. Fan , Peter L. Guo , Sophie C. C. Sun

We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…

Combinatorics · Mathematics 2015-03-13 Joel Brewster Lewis

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal…

Combinatorics · Mathematics 2023-06-22 Ran Pan , Jeffrey B. Remmel

We are interested in the asymptotics of the number of standard Young tableaux $f^{\lambda/\mu}$ of a given skew shape $\lambda/\mu$. We mainly restrict ourselves to the case where both diagrams are balanced, but investigate all growth…

Combinatorics · Mathematics 2019-02-08 Jehanne Dousse , Valentin Féray

We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…

Combinatorics · Mathematics 2019-07-24 Michael Bukata , Ryan Kulwicki , Nicholas Lewandowski , Lara Pudwell , Jacob Roth , Teresa Wheeland

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

Combinatorics · Mathematics 2026-03-17 Alexander Dobner

The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…

Combinatorics · Mathematics 2020-05-22 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…

Combinatorics · Mathematics 2021-05-18 Zachary Hamaker , Alejandro H. Morales , Igor Pak , Luis Serrano , Nathan Williams

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

Combinatorics · Mathematics 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

Let T^* be a standard Young tableau of k cells. We show that the probability that a Young tableau of n cells contains T^* as a subtableau is, in the limit n -> \infty, equal to \nu(\pi(T^*))/k!, where \pi(T^*) is the shape (= Ferrers…

Combinatorics · Mathematics 2007-05-23 Brendan D. McKay , Jennifer Morse , Herbert S. Wilf

In this paper, we explore the relationship between quasisymmetric Schur $Q$-functions and peak Young quasisymmetric Schur functions. We introduce a bijection on $\mathsf{SPIT}(\alpha)$ such that $\{\mathrm{w}_{\rm c}(T) \mid T \in…

Combinatorics · Mathematics 2025-07-09 Seung-Il Choi , Sun-Young Nam , Young-Tak Oh

The action of the cactus group $C_n$ on Young tableaux of a given shape $\lambda$ goes back to Berenstein and Kirillov and arises naturally in the study of crystal bases and quantum integrable systems. We show that this action is…

Combinatorics · Mathematics 2026-01-07 Sophia Liao , Leonid Rybnikov

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…

Combinatorics · Mathematics 2020-02-06 Sho Matsumoto , Piotr Śniady

Edelman and Greene constructed a bijection between the set of standard Young tableaux and the set of balanced Young tableaux of the same shape. Fomin, Greene, Reiner and Shimozono introduced the notion of balanced Rothe tableaux of a…

Combinatorics · Mathematics 2016-07-14 Neil J. Y. Fan

We introduce new natural generalizations of the classical descent and inversion statistics for permutations, called width-$k$ descents and width-$k$ inversions. These variations induce generalizations of the excedance and major statistics,…

Combinatorics · Mathematics 2017-01-18 Robert Davis

We prove a new CLT for the difference of linear eigenvalue statistics of a Wigner random matrix $H$ and its minor $\hat H$ and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a…

Probability · Mathematics 2018-07-11 László Erdős , Dominik Schröder

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

Combinatorics · Mathematics 2007-09-05 Yuliy Baryshnikov , Dan Romik

Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…

Combinatorics · Mathematics 2024-03-25 Sergi Elizalde
‹ Prev 1 2 3 10 Next ›