Related papers: Reconstructing Young Tableaux
We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we…
We give a bijection between the symmetric group S_n, and the set of standard Young tableaux of rectangular shape m^n, m<=n, that have order n under jeu de taquin promotion.
We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising…
The crystals for finite dimensional representations of sl(n+1) can be realized using Young tableaux. The infinity crystal on the other hand is naturally realized using multisegments, and there is a simple description of the embedding of…
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover…
We construct Young wall models for the crystal bases of level $1$ irreducible highest weight representations and Fock space representations of quantum affine algebras in types $E_{6}^{(1)}$, $E_{7}^{(1)}$ and $E_{8}^{(1)}$. In each case,…
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This implies via properties of the Edelman-Greene bijection…
In symmetric groups, a two-sided cell is the set of all permutations which are mapped by the Robinson-Schensted correspondence on a pair of tableaux of the same shape. In this article, we show that the set of permutations in a two-sided…
This article gives a new upper bound for the resurgence number of symbolic powers of matroidal configuration in the following situations: the height of the matroidal configuration is big, or the height is small, and the corresponding…
This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…
Recent developments in shape reconstruction and comparison call for the use of many different (topological) descriptor types, such as persistence diagrams and Euler characteristic functions. We establish a framework to quantitatively…
A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…
In the standard set reconciliation problem, there are two parties $A_1$ and $A_2$, each respectively holding a set of elements $S_1$ and $S_2$. The goal is for both parties to obtain the union $S_1 \cup S_2$. In many distributed computing…
This is the second in a series of papers which give an explicit description of the reconstruction algebra as a quiver with relations; these algebras arise naturally as geometric generalizations of preprojective algebras of extended Dynkin…
A Young diagram $Y$ is called wide if every sub-diagram $Z$ formed by a subset of the rows of $Y$ dominates $Z'$, the conjugate of $Z$. A Young diagram $Y$ is called Latin if its squares can be assigned numbers so that for each $i$, the…
We study the crystal base of the negative part of a quantum group. An explicit realization of the crystal is given in terms of Young tableaux for types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$. Connection between our realization and a previous…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
We study the circumstances under which one can reconstruct a stack from its associated functor of isomorphism classes. This is possible surprisingly often: we show that many of the standard examples of moduli stacks are determined by their…
This work is concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of…
We consider the recovery of real-valued bandlimited functions from the absolute values of their samples, possibly spaced nonuniformly. We show that such a reconstruction is always possible if the function is sampled at more than twice its…