English
Related papers

Related papers: Enumeration of bounded lecture hall tableaux

200 papers

The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their…

Combinatorics · Mathematics 2017-07-11 Robert A. Proctor , Matthew J. Willis

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

The $q$-Whittaker function $W_\lambda(\mathbf{x};q)$ associated to a partition $\lambda$ is a $q$-analogue of the Schur function $s_\lambda(\mathbf{x})$, and is defined as the $t=0$ specialization of the Macdonald polynomial…

Combinatorics · Mathematics 2025-02-11 Steven N. Karp , Hugh Thomas

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

A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…

Combinatorics · Mathematics 2007-05-23 Anatol N. Kirillov , Anne Schilling , Mark Shimozono

In 1997 Bousquet-M\'elou and Eriksson introduced lecture hall partitions as the inversion vectors of elements of the parabolic quotient $\widetilde{C}/C$. We provide a new view of their correspondence that allows results in one domain to be…

Combinatorics · Mathematics 2017-08-04 Christopher R. H. Hanusa , Carla D. Savage

We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…

Combinatorics · Mathematics 2025-02-10 Christian Krattenthaler

We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…

Combinatorics · Mathematics 2018-05-22 Samuel Johnson , Marni Mishna , Karen Yeats

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

Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We define…

Combinatorics · Mathematics 2019-03-19 Rosena R. X. Du , Xiaojie Fan , Yue Zhao

We introduce edge labeled Young tableaux. Our main results provide a corresponding analogue of [Sch\"{u}tzenberger '77]'s theory of jeu de taquin. These are applied to the equivariant Schubert calculus of Grassmannians. Reinterpreting, we…

Combinatorics · Mathematics 2018-08-14 Hugh Thomas , Alexander Yong

In this paper, we consider a natural extension of several results related to Krall-type polynomials introducing a modification of a $q$-classical linear functional via the addition of one or two mass points. The limit relations between the…

Classical Analysis and ODEs · Mathematics 2015-02-18 R. Álvarez-Nodarse , R. S. Costas-Santos

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…

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…

Number Theory · Mathematics 2024-11-18 Mikołaj Frączyk , Gergely Harcos , Péter Maga

We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…

Combinatorics · Mathematics 2007-06-13 Christoph Schwer

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

Combinatorics · Mathematics 2008-04-08 Hjalmar Rosengren

The Littlewood-Richardson (LR) coefficient counts among many other things the LR tableaux of a given shape and a given content. We prove, that the number of LR tableaux weakly increases if one adds to the shape and the content the shape and…

Combinatorics · Mathematics 2011-03-24 Christian Gutschwager

These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…

Algebraic Geometry · Mathematics 2021-06-01 Grigoriy Blekherman , Jannik Wesner

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

Combinatorics · Mathematics 2019-02-04 Shishuo Fu , Dazhao Tang , Ae Ja Yee

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
‹ Prev 1 3 4 5 6 7 10 Next ›