English
Related papers

Related papers: On the Enumeration of Skew Young Tableaux

200 papers

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 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

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

The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…

Combinatorics · Mathematics 2023-09-19 Alejandro H. Morales , Daniel G. Zhu

The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…

Probability · Mathematics 2023-05-09 Mohamed Slim Kammoun

In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Stephan Pfannerer , Martin Rubey , Joakim Uhlin

Let $S(d,N)$ denote the number of permutations in the symmetric group on $[N]$ which have no decreasing subsequence of length $d+1.$ We prove that $S(d,dn)$ is asymptotically equal to the number of standard Young tableaux of rectangular…

Combinatorics · Mathematics 2010-02-12 Jonathan Novak

We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…

Combinatorics · Mathematics 2025-08-12 Lucas Teyssier

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

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

In previous work Regev used part of the representation theory of Lie superalgebras to compute the values of a character of the symmetric group whose decomposition into irreducible constituents is described by semistandard…

Representation Theory · Mathematics 2017-09-28 Jay Taylor

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

The skew Schubert polynomials are those which are indexed by skew elements of the Weyl group, in the sense of arXiv:0812.0639. We obtain tableau formulas for the double versions of these polynomials in all four classical Lie types, where…

Combinatorics · Mathematics 2024-01-30 Harry Tamvakis

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…

Combinatorics · Mathematics 2013-02-05 Ping Sun

Vershik and Kerov gave asymptotical bounds for the maximal and the typical dimensions of irreducible representations of symmetric groups $S_n$. It was conjectured by G. Olshanski that the maximal and the typical dimensions of the isotypic…

Representation Theory · Mathematics 2011-10-21 Sevak Mkrtchyan

The hook length formula gives a product formula for the number of standard Young tableaux of a partition shape. The number of standard Young tableaux of a skew shape does not always have a product formula. However, for some special skew…

Combinatorics · Mathematics 2018-06-06 Jang Soo Kim , Meesue Yoo

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

The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…

Combinatorics · Mathematics 2019-06-26 Alejandro Morales , Igor Pak , Greta Panova

The new approach to the theory of complex representrations of the finite symmetric groups which based on the notions of Coxeter generators., Gelfand-Zetlin algebras, Hecke algebra, Young-Jucys-Murphi generators and which hardly used…

Representation Theory · Mathematics 2007-05-23 A. M. Vershik , A. Yu. Okounkov
‹ Prev 1 2 3 10 Next ›