English
Related papers

Related papers: Set-Valued Young Tableaux and Product-Coproduct Pr…

200 papers

We study graded dimension formulas for finite quiver Hecke algebras $R^{\Lambda_0}(\beta)$ of type $A^{(2)}_{2\ell}$ and $D^{(2)}_{\ell+1}$ using combinatorics of Young walls. We introduce the notion of standard tableaux for proper Young…

Representation Theory · Mathematics 2014-04-03 Se-jin Oh , Euiyong Park

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

We prove that the number of oscillating tableaux of length $n$ with at most $k$ columns, starting at $\emptyset$ and ending at the one-column shape $(1^m)$, is equal to the number of standard Young tableaux of size~$n$ with $m$ columns of…

Combinatorics · Mathematics 2016-08-29 Christian Krattenthaler

This is the third paper in the series. Here we define a few combinatorial orders on Young tableaux. The first order is obtained from induced Duflo order by the extension with the help of Vogan T_{\alpha, \beta} procedure. We call it…

Representation Theory · Mathematics 2007-05-23 Anna Melnikov

The number of standard Young tableaux of a skew shape $\lambda/\mu$ can be computed as a sum over excited diagrams inside $\lambda$. Excited diagrams are in bijection with certain lozenge tilings, with flagged semistandard tableaux and also…

Combinatorics · Mathematics 2024-09-27 Greta Panova , Leonid Petrov

Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.

Combinatorics · Mathematics 2022-01-10 Shaun V. Ault

In this paper we first study $k \times n$ Youden rectangles of small orders. We have enumerated all Youden rectangles for a range of small parameter values, excluding the almost square cases where $k = n-1$, in a large scale computer…

Combinatorics · Mathematics 2023-06-22 Gerold Jäger , Klas Markström , Denys Shcherbak , Lars-Daniel Öhman

We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…

Combinatorics · Mathematics 2017-09-21 Joshua P. Swanson

We give some special values of Grothendieck polynomials and an explicit formula for the number of set-valued tableaux. For Young diagrams consisting of a single row or a single column, both the value and number are written by the Gauss'…

Combinatorics · Mathematics 2024-02-13 Taikei Fujii , Takahiko Nobukawa , Tatsushi Shimazaki

Closed formulas are known for $S(k,0;n)$, the number of standard Young tableaux of size $n$ and with at most $k$ parts, where $1\le k\le 5$. Here we study the analogue problem for $S(k,\ell;n)$, the number of standard Young tableaux of size…

Combinatorics · Mathematics 2010-03-16 Amitai Regev

Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for $\lambda$ a partition of $n$,…

Combinatorics · Mathematics 2023-05-10 Antoine Labelle , Stoyan Dimitrov

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Rings and Algebras · Mathematics 2007-05-23 Constantin M. Petridi , P. B. Krikelis

We compute the depth and regularity of ideals associated with arbitrary fillings of positive integers to a Young diagram, called the tableau ideals.

Commutative Algebra · Mathematics 2023-11-15 Do Trong Hoang , Thanh Vu

The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

We characterise those classes of permutations having the property that for every tableau shape either every permutation of that shape or no permutation of that shape belongs to the class. The characterisation is in terms of the dominance…

Combinatorics · Mathematics 2012-04-19 Michael Albert

The Selberg integral is an important integral first evaluated by Selberg in 1944. Stanley found a combinatorial interpretation of the Selberg integral in terms of permutations. In this paper, new combinatorial objects "Young books" are…

Combinatorics · Mathematics 2014-09-05 Jang Soo Kim , Suho Oh

In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the normalized variance, $V/E^2$, is bounded if and only if a certain…

Combinatorics · Mathematics 2007-05-23 Peter A. Hasto

We give new bounds and asymptotic estimates on the number of standard Young tableaux of skew shape in a variety of special cases. Our approach is based on Naruse's hook-length formula. We also compare our bounds with the existing bounds on…

Combinatorics · Mathematics 2017-03-16 Alejandro Morales , Igor Pak , Greta Panova

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