English
Related papers

Related papers: Generating Functions for Inverted Semistandard You…

200 papers

A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau column-standard. An $i$-inverted Young tableau is a row-standard tableau with precisely…

Combinatorics · Mathematics 2015-08-06 Paul Drube

A tableau inversion is a pair of entries in row-standard tableau $T$ that lie in the same column of $T$ yet lack the appropriate relative ordering to make $T$ column-standard. An $i$-inverted Young tableau is a row-standard tableau along…

Combinatorics · Mathematics 2015-06-24 Jonathan E. Beagley , Paul Drube

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

Based on Sch\"utzenberger's evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function…

Combinatorics · Mathematics 2007-05-23 Martin Rubey

Recently, Banderier et. al. considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. We count the numbers $\overline{f}_m(n)$ of Young tableaux of shape…

Combinatorics · Mathematics 2024-01-29 Feihu Liu , Guoce Xin

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…

Combinatorics · Mathematics 2011-07-21 Jong Hyun Kim

A specialisation of a transformation formula for multi-dimensional elliptic hypergeometric series is used to provide compact, non-determinantal formulae for the generating function with respect to the major index of standard Young tableaux…

Combinatorics · Mathematics 2014-12-30 Christian Krattenthaler , Michael J. Schlosser

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…

Combinatorics · Mathematics 2020-06-26 Jang Soo Kim , Michael J. Schlosser , Meesue Yoo

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 connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…

Combinatorics · Mathematics 2019-11-26 Ekaterina A. Vassilieva

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

By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…

Combinatorics · Mathematics 2019-08-15 Peter S. Campbell , Anna Stokke

Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…

Combinatorics · Mathematics 2017-10-05 Paul Drube

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

We construct the independent particle representation for the Semistandard Young Tableaux (SsYT) of skew shape $\lambda/\mu.$ The partition function of this particle system gives the generating function of the SsYT of skew shape…

Combinatorics · Mathematics 2025-06-25 Oleg Ogievetsky , Senya Shlosman

Recently, Naruse discovered a hook length formula for the number of standard Young tableaux of a skew shape. Morales, Pak and Panova found two $q$-analogs of Naruse's hook length formula over semistandard Young tableaux (SSYTs) and reverse…

Combinatorics · Mathematics 2017-11-08 Byung-Hak Hwang , Jang Soo Kim , Meesue Yoo , Sun-mi Yun

This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of…

Combinatorics · Mathematics 2021-12-15 Alan J. Cain , Erkko Lehtonen

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…

Combinatorics · Mathematics 2023-11-16 Alejandro H. Morales , Greta Panova , GaYee Park

The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…

Combinatorics · Mathematics 2024-04-30 Richard J. Mathar
‹ Prev 1 2 3 10 Next ›