Related papers: Product formulas for certain skew tableaux

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…

An element of a Weyl group of classical type is skew if it is the left factor in a reduced factorization of a Grassmannian element. The skew Grothendieck polynomials are those which are indexed by skew elements of the Weyl group. We define…

The Selberg integral is an important integral first evaluated by Selberg in 1944. Stanley found a combinatorial interpretation of the Selberg integral in terms of permutations. In this paper, new combinatorial objects "Young books" are…

The product formula for evaluating products of skew polynomials is used to construct a class of rings. As an application, we present a method of evaluating quotients of skew polynomials.

Let $P$ be the Gelfand--Tsetlin polytope defined by the skew shape $\lambda/\mu$ and weight $w$. In the case corresponding to a standard Young tableau, we completely characterize for which shapes $\lambda/\mu$ the polytope $P$ is integral.…

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…

We prove and generalize a conjecture in arXiv:1610.0474(4) about the asymptotics of $\frac{1}{\sqrt{n!}} f^{\lambda/\mu}$, where $f^{\lambda/\mu}$ is the number of standard Young tableaux of skew shape $\lambda/\mu$ which have stable limit…

Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…

We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…

Generalizing a theorem of Macdonald, we show a formula for the mixed Hodge structure on the cohomology of the symmetric products of bounded complexes of mixed Hodge modules by showing the existence of the canonical action of the symmetric…

We present a bijective proof of the hook-length formula for shifted standard tableaux of a fixed shape based on a modified jeu de taquin and the ideas of the bijective proof of the hook-length formula for ordinary standard tableaux by…

Set-valued standard Young tableaux are a generalization of standard Young tableaux due to Buch (2002) with applications in algebraic geometry. The enumeration of set-valued SYT is significantly more complicated than in the ordinary case,…

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…

The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…

The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths $a,b,c,a,b,c$ (in cyclic…

Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure…

We present a new kind of normalization theorem: linearization theorem for skew products. The normal form is a skew product again, with the fiber maps linear. It appears, that even in the smooth case, the conjugacy is only H\"older…

Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…

In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new…

In this paper, we give strong lower bounds on the size of the sets of products of matrices in some certain groups. More precisely, we prove an analogue of a result due to Chapman and Iosevich for matrices in $SL_2(\mathbb{F}_p)$ with…