Related papers: A probabilistic approach for enumeration of certai…

We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…

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…

We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

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…

In this paper, we present a novel approach to compute ambiguities in thinned uniform linear arrays, i.e., sparse non-uniform linear arrays, via a mixed-integer program. Ambiguities arise when there exists a set of distinct…

A simple generative model for rank ordered data with ties is presented. The model is based on ordering geometric latent variables and can be seen as the discrete counterpart of the Plackett-Luce (PL) model, a popular, relatively tractable…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

Let $L(m,n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m\times n$ rectangle. It is a classical result that the partially ordered set $L(m,n)$ is rank-symmetric, rank-unimodal, and…

This work uses the Bayesian inference technique to infer the Young modulus from the stochastic linear elasticity equation. The Young modulus is modeled by a finite Karhunen Lo\'{e}ve expansion, while the solution to the linear elasticity…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…

We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…

We present a new characterization of the shape equivalent class and the Littlewood-Richardson correspondence of Young tableaux in terms of tropical (ultradiscrete) integrable systems. As an application, an alternative proof of the "shape…

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…

We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and…

We show that the Young tableaux theory and constructions of the irreducible representations of the Weyl groups of type A, B and D, Iwahori-Hecke algebras of types A, B, and D, the complex reflection groups G(r,p,n) and the corresponding…

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…

A Young diagram is \emph{Latin} if there is an assignment of integers to its cells so that each row $i$ of length $l_i$ is populated by the numbers $1,\ldots,l_i$, and the numbers in each column are distinct. A Young diagram is called…

The character theory of symmetric groups, and the theory of symmetric functions, both make use of the combinatorics of Young tableaux, such as the Robinson-Schensted algorithm, Schuetzenberger's "jeu de taquin", and evacuation. In 1995…

The $k$-Young lattice $Y^k$ is a partial order on partitions with no part larger than $k$. This weak subposet of the Young lattice originated from the study of the $k$-Schur functions(atoms) $s_\lambda^{(k)}$, symmetric functions that form…