Related papers: Reconstructing Young Tableaux
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas…
The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference sequence, is considered. First, in the regime in which the…
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n, B_n and C_n. This description is in terms of Young tableaux and…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
A fully algebraic approach to reconstructing one-dimensional reflectionless potentials is described. A simple and easily applicable general formula is derived, using the methods of the theory of determinants. In particular, useful…
Denote by $N \subset SL_k$ the subgroup of unipotent upper triangular matrices. In this paper, we show that the dual canonical basis of $\mathbb{C}[N]$ (and base affine spaces) can be parameterized by semi-standard Young tableaux. Moreover,…
In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…
Network reconstruction consists in retrieving the hidden interaction structure of a system from observations. Many reconstruction algorithms have been proposed, although less research has been devoted to describe their theoretical…
This paper considers the recovery of a low-rank matrix from an observed version that simultaneously contains both (a) erasures: most entries are not observed, and (b) errors: values at a constant fraction of (unknown) locations are…
Nominal sets provide a foundation for reasoning about names. They are used primarily in syntax with binders, but also, e.g., to model automata over infinite alphabets. In this paper, nominal sets are related to nominal renaming sets, which…
Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let $\mathcal{F}_d(n)$ denote the set of minimal permutations of length $n$ with $d$…
Given an action of a group $G$ on a set $S$, the $k$-deck of a subset $T$ of $S$ is the multiset of all subsets of $T$ of size $k$, each given up to translation by $G$. For a given subset $T$, the {\em reconstruction number} of $T$ is the…
The medial axis of a closed set is well established tool in pattern recognition, cherished for its power of reconstruction of domains. In this article we fill this gap answering the question which sets precisely are reconstructible from the…
We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…
We describe two aspects of the behaviour of entries of Young tableaux during the application of the Novelli-Pak-Stoyanovskii algorithm. We derive two theorems which both contain a generalized version of a conjecture by Krattenthaler and…
We will show that a necessary and sufficient condition for a Ferrers board (or Young Diagrams) to be fully tileable with 1x2 dominoes requires the board to be 2-colorable such that no color is adjacent to its own color using both induction…
It is common for people to create different types of charts to explore a multi-dimensional dataset (table). However, to recommend commonly composed charts in real world, one should take the challenges of efficiency, imbalanced data and…
In this paper we reformulate few-shot classification as a reconstruction problem in latent space. The ability of the network to reconstruct a query feature map from support features of a given class predicts membership of the query in that…
Let M be a random (alpha n) x n matrix of rank r<<n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(rn) observed entries with relative root mean…