Related papers: Reconstructing Young Tableaux
We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
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…
Retrieving relevant tables containing the necessary information to accurately answer a given question over tables is critical to open-domain question-answering (QA) systems. Previous methods assume the answer to such a question can be found…
The jeu de taquin process produced a standard Young tableau from a skew standard Young tableau by shifting its entries to the northwest. We generalize this process to posets: certain partial numberings of any poset are shifted upward. A…
A tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are fused when possible, which reduces the size of the proof. It…
We give three algorithms to construct a semistandard tableau of given shape and weight, where the weight is a composition which is not necessarily a partition. With respect to a natural partial order on the set of semistandard tableaux, we…
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1's on each row are consecutive. A Minimal Conflicting Set is a set of rows that does not have the C1P, but every proper subset has…
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…
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…
Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for $\lambda$ a partition of $n$,…
Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…
We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In…
In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…
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…
This paper is concerned with integrals which integrands are the monomials of matrix elements of irreducible representations of classical groups. Based on analysis on Young tableaux, we discuss some related duality theorems and compute the…
Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…
We characterize collections of orthogonal projections for which it is possible to reconstruct a vector from the magnitudes of the corresponding projections. As a result we are able to show that in an $M$-dimensional real vector space a…
We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs…
In this paper, we consider matrix completion from non-uniformly sampled entries including fully observed and partially observed columns. Specifically, we assume that a small number of columns are randomly selected and fully observed, and…