English
Related papers

Related papers: On the Limiting Vacillating Tableaux for Integer S…

200 papers

Linked partitions are introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux are introduced by Steingr\'{i}msson and Williams in the study of totally positive Grassmannian cells. Let…

Combinatorics · Mathematics 2013-05-24 William Y. C. Chen , Lewis H. Liu , Carol J. Wang

A Latin tableau of shape $\lambda$ and type $\mu$ is a Young diagram of shape $\lambda$ in which each box contains a single positive integer, with no repeated integers in any row or column, and the $i$th most common integer appearing…

Combinatorics · Mathematics 2024-08-09 Timothy Y. Chow , Mark G. Tiefenbruck

We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…

Combinatorics · Mathematics 2020-07-07 Rosa Orellana , Mike Zabrocki

The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin…

Combinatorics · Mathematics 2014-03-21 Robin Sulzgruber

We prove a $q$-analog of the following result due to McKay, Morse and Wilf: the probability that a random standard Young tableau of size $n$ contains a fixed standard Young tableau of shape $\lambda\vdash k$ tends to $f^{\lambda}/k!$ in the…

Combinatorics · Mathematics 2011-08-30 Jang Soo Kim

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

The conjugacy classes of nilpotent $n\times n$ matrices can be parametrised by partitions $\lambda$ of $n$, and for a nilpotent $\eta$ in the class parametrised by $\lambda$, the variety $F_\eta$ of $\eta$-stable flags has its irreducible…

Combinatorics · Mathematics 2007-05-23 Marc A. A. van Leeuwen

Let $a_k(n)$ denotes the number of representations of a non-negative integer $n$ as sum of $k$ quadratic forms of the type $x^2+xy+y^2$ and $a_{\lambda_1,\lambda_2,\lambda_3\dots\lambda_k}(n)$ denotes the number of representations $n$ as a…

History and Overview · Mathematics 2024-01-23 Kritika Kashyap

It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau converges to a deterministic limit. We study the fluctuations from this limit along the edges of the rectangle. We show that in…

Probability · Mathematics 2015-10-23 Philippe Marchal

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

Combinatorics · Mathematics 2024-12-11 Michael Neubauer , Harmony Vargas

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

Combinatorics · Mathematics 2011-11-29 Roger E. Behrend

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

Given a random word of size $n$ whose letters are drawn independently from an ordered alphabet of size $m$, the fluctuations of the shape of the random RSK Young tableaux are investigated, when $n$ and $m$ converge together to infinity. If…

Probability · Mathematics 2021-06-08 Jean-Christophe Breton , Christian Houdré

For $\ell \geq 1$ and $k \geq 2$, we consider certain admissible sequences of $k-1$ lattice paths in a colored $\ell \times \ell$ square. We show that the number of such admissible sequences of lattice paths is given by the sum of squares…

Combinatorics · Mathematics 2015-08-28 Rebecca L. Jayne , Kailash C. Misra

Consider a complex classical semi-simple Lie group along with the set of its nilpotent coadjoint orbits. When the group is of type A, the set of orbital varieties contained in a given nilpotent orbit is described a set of standard Young…

Representation Theory · Mathematics 2007-05-23 Thomas Pietraho

We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…

Combinatorics · Mathematics 2012-05-31 Greta Panova

We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…

Combinatorics · Mathematics 2024-01-10 Graeme Henrickson , Anna Stokke , Max Wiebe

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

Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can contain unordered sets of integers, with the added condition that every integer at position $(i,j)$ must be smaller that every integer at…

Combinatorics · Mathematics 2018-03-21 Paul Drube , Maxwell Krueger , Ashley Skalsky , Meghan Wren