中文
相关论文

相关论文: Identities for the number of standard Young tablea…

200 篇论文

Using Symbolic Computation with Maple, we can discover lots of (rigorously-proved!) facts about Standard Young Tableaux, in particular the distribution of the entries in any specific cell, and the sorting probabilities.

组合数学 · 数学 2023-03-31 Shalosh B. Ekhad , Doron Zeilberger

We present an elegant bijection between standard Young tableaux with 2n cells and at most two rows, and pairs of standard Young tableaux of the same shape, with n+1 cells, where only the top row can have more than one cell.

组合数学 · 数学 2010-02-23 Amitai Regev , Doron Zeilberger

We consider $\beta$--Plancherel measures \cite{Ba.Ra.} on subsets of partitions -- and their asymptotics. These subsets are the Young diagrams contained in a $(k,\ell)$--hook, and we calculate the asymptotics of the expected shape of these…

组合数学 · 数学 2007-05-23 Amitai Regev

A standard barely set-valued tableau of shape $\lambda$ is a filling of the Young diagram $\lambda$ with integers $1,2,\dots,|\lambda|+1$ such that the integers are increasing in each row and column, and every cell contains one integer…

组合数学 · 数学 2020-06-26 Jang Soo Kim , Michael J. Schlosser , Meesue Yoo

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…

组合数学 · 数学 2025-08-12 Lucas Teyssier

Let $b_{n,k}$ denote the number of hooks of length $k$ in all the $t$-regular partitions of $n$. Singh and Barman raised the question of finding the relation between $b_{t,2}(n)$ and $b_{t,1}(n)$. Kim showed that there exists $N$ such that…

组合数学 · 数学 2025-05-01 Hongshu Lin , Wenston J. T. Zang

We give new product formulas for the number of standard Young tableaux of certain skew shapes and for the principal evaluation of the certain Schubert polynomials. These are proved by utilizing symmetries for evaluations of factorial Schur…

组合数学 · 数学 2020-06-03 Alejandro H. Morales , Igor Pak , Greta Panova

An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely $k$ inversion pairs is said to be…

组合数学 · 数学 2016-06-16 Paul Drube

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…

组合数学 · 数学 2017-09-21 Joshua P. Swanson

Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula (NHLF) as a positive sum over excited diagrams of products of…

组合数学 · 数学 2023-11-16 Alejandro H. Morales , Greta Panova , GaYee Park

Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,\ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $\ell$ points of $S$ in their interior. We prove several equalities for the…

We consider families $\mathcal{P}_n$ of plane lattice paths enumerated by Guy, Krattenthaler, and Sagan (1992). We show by explicit bijection that these families are equinumerous with the set $\mathrm{SYT}(n+2,2,1^n)$ of standard Young…

It is known that for the Young diagram of any partition of an integer $n$, the sum of squares of the hook lengths of its cells is exactly $n^2$ more than that of the contents of its cells. That is, for any partition $\lambda$ of an integer…

组合数学 · 数学 2025-04-16 Krishna Menon

We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.

综合数学 · 数学 2020-12-22 Sumit Kumar Jha

The enumeration of standard Young tableaux (SYTs) of shape {\lambda} can be easily computed by the hook-length formula. In 1981, Amitai Regev proved that the number of SYTs having at most three rows with n entries equals the nth Motzkin…

组合数学 · 数学 2011-07-21 Jong Hyun Kim

The study of representations of affine Hecke algebras has led to a new notion of shapes and standard Young tableaux which works for the root system of any finite Coxeter group. This paper is completely independent of affine Hecke algebra…

表示论 · 数学 2007-05-23 Arun Ram

A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…

组合数学 · 数学 2024-12-24 Zhanar Berikkyzy , Pamela E. Harris , Anna Pun , Catherine Yan , Chenchen Zhao

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…

表示论 · 数学 2014-04-03 Se-jin Oh , Euiyong Park

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…

组合数学 · 数学 2019-02-08 Jehanne Dousse , Valentin Féray

For $d\in\mathbb{N}$, let $S$ be a set of points in $\mathbb{R}^d$ in general position. A set $I$ of $k$ points from $S$ is a $k$-island in $S$ if the convex hull $\mathrm{conv}(I)$ of $I$ satisfies $\mathrm{conv}(I) \cap S = I$. A…

组合数学 · 数学 2022-02-08 Martin Balko , Manfred Scheucher , Pavel Valtr