English
Related papers

Related papers: Enumeration formulas for Young tableaux in a diago…

200 papers

Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using of the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and…

Combinatorics · Mathematics 2015-06-25 Ping Sun

Quasi-Yamanouchi tableaux connect the two most studied types of tableaux. They are a subset of semistandard Young tableaux that are also a refinement on standard Young tableaux, and they can be used to improve the fundamental quasisymmetric…

Combinatorics · Mathematics 2018-02-21 George Wang

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

Combinatorics · Mathematics 2011-04-19 Yasuhide Numata

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

We derive two new identities involving the Bernoulli numbers, the Euler numbers, and the Stirling numbers of the first kind using analytic continuation of a well known identity for the Stirling numbers of the first kind.

Combinatorics · Mathematics 2020-02-18 Sumit Kumar Jha

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…

Combinatorics · Mathematics 2016-06-16 Paul Drube

We derive several symmetric identities for Bernoulli and Euler polynomials which imply some known identities. Our proofs depend on the new technique developed in part I and some identities obtained in [European J. Combin. 24(2003),…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun , Hao Pan

Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…

Probability · Mathematics 2026-03-31 Anton Nazarov , Anton Selemenchuk

We provide a unified combinatorial framework connecting Entringer numbers, Dumont-Viennot snakes, and elliptically weighted continued fractions, which gives a structural interpretation of the Jacobi elliptic identity \begin{equation}…

Combinatorics · Mathematics 2026-02-17 Jean-christophe Pain

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…

Number Theory · Mathematics 2018-05-16 Yilmaz Simsek

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

In this paper we establish plenty of number theoretic and combinatoric identities involving generalized Bernoulli and Stirling numbers of both kinds. These formulas are deduced from Pascal type matrix representations of Bernoulli and…

Number Theory · Mathematics 2015-06-12 Mümün Can , M. Cihat Dağlı

We study the Young graph with edge multiplicities arising in a Pieri-type formula for Jack symmetric polynomials $P_\mu(x;a)$ with a parameter $a$. Starting with the empty diagram, we define recurrently the `dimensions' $\dim_a$ in the same…

Combinatorics · Mathematics 2007-05-23 Sergei Kerov

Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by…

Combinatorics · Mathematics 2007-05-23 Mathias Lederer

Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on variations of a straightening process that expresses a filling of a Young diagram…

Combinatorics · Mathematics 2023-12-27 Reuven Hodges

We present a new method for the derivation of convolution identities for finite sums of products of Bernoulli numbers. Our approach is motivated by the role of these identities in quantum field theory and string theory. We first show that…

Number Theory · Mathematics 2014-03-04 Gerald V. Dunne , Christian Schubert

Let $U$ be a matrix chosen randomly, with respect to Haar measure, from the unitary group $U(d).$ We express the moments of the trace of any submatrix of $U$ as a sum over partitions whose terms count certain standard and semistandard Young…

Combinatorics · Mathematics 2007-05-23 Jonathan Novak

We give a direct proof of the equivalence between the Giambelli and Pieri type formulas for Hall-Littlewood functions using Young's raising operators, parallel to joint work with Buch and Kresch for the Schubert classes on isotropic…

Combinatorics · Mathematics 2013-09-10 Harry Tamvakis

In this note we give a new proof of a closed formula for the multivariable generating series of diagonally colored Young diagrams. This series also describes the Euler characteristics of certain Nakajima quiver varieties. Our proof is a…

Combinatorics · Mathematics 2016-07-14 Ádám Gyenge

The spectral decomposition of the path space of the vertex model associated to the level $l$ representation of the quantized affine algebra $U_q(\hat{sl}_n)$ is studied. The spectrum and its degeneracy are parametrized by skew Young…

q-alg · Mathematics 2011-01-28 Anatol N. Kirillov , Atsuo Kuniba , Tomoki Nakanishi