Related papers: Reconstructing Young Tableaux
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…
We study the problem of finding Young diagrams of maximum dimension, i. e. those with the largest number of Young tableaux of their shapes. Consider a class of Young diagrams that differ from a symmetric diagram by no more than one box…
A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…
We provide an algebraic-geometrical interpretation of the classical semistandard Young-tableaux via the notion of Seshadri stratifications. The columns appearing in such a tableau correspond to vanishing multiplicities of certain rational…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice…
For every ordered set, we reconstruct the deck obtained by removal of the elements of rank r that are neither minimal nor maximal. Consequently, we also reconstruct the deck obtained by removal of the extremal, that is, minimal or maximal,…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.
By utilizing the combinatorial properties of various tableau models, we establish an explicit correspondence between the polyhedral realizations of the crystal bases $\mathcal B(\lambda)$ (resp. $\mathcal B(\infty)$) of type $A_n$ and the…
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…
In this note, a statistic on Young tableaux is defined which encodes data needed for the Casselman-Shalika formula.
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…
This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candes and Recht, Candes and Tao, and Keshavan, Montanari, and…
In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in…
Motivated by applications in polymer-based data storage, we study the problem of reconstructing a string from part of its composition multiset. We give a full description of the structure of the strings that cannot be uniquely reconstructed…
Barely set-valued tableaux are a variant of Young tableaux in which one box contains two numbers as its entry. It has recently been discovered that there are product formulas enumerating certain classes of barely set-valued tableaux. We…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
Young tableaux are combinatorial objects whose construction can be achieved from words over a finite alphabet by row or column insertion as shown by Schensted sixty years ago. Recently Abram and Reutenauer studied the action the free monoid…
Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.