Related papers: Young tableau reconstruction via minors

Given an edge-weighted graph, how many minimum $k$-cuts can it have? This is a fundamental question in the intersection of algorithms, extremal combinatorics, and graph theory. It is particularly interesting in that the best known bounds…

We approach the Torelli problem of recostructing a curve from its Jacobian from a computational point of view. Following Dubrovin, we design a machinery to solve this problem effectively, which builds on methods in numerical algebraic…

We prove that the number of oscillating tableaux of length $n$ with at most $k$ columns, starting at $\emptyset$ and ending at the one-column shape $(1^m)$, is equal to the number of standard Young tableaux of size~$n$ with $m$ columns of…

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. We prove that $r_4(5,n)\ge 2^{2^{cn^{1/7}}}$, where $c>0$ is an absolute…

The $k$-deck of a graph is its multiset of induced subgraphs on $k$ vertices. We prove that $n$-vertex graphs with maximum degree $2$ have the same $k$-decks if each cycle has at least $k+1$ vertices, each path component has at least $k-1$…

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…

The graph parameter treedepth is minor-monotone; hence, the class of graphs with treedepth at most $k$ is minor-closed. By the Graph Minor Theorem, such a class is characterized by a finite set of forbidden minors. A conjecture of…

The classical Cauchy-Davenport theorem implies the lower bound n+1 for the number of distinct subsums that can be formed from a sequence of n elements of the cyclic group Z_p (when p is prime and n<p). We generalize this theorem to a…

Let $K\_{[k,t]}$ be the complete graph on $k$ vertices from which a set of edges, induced by a clique of order $t$, has been dropped. In this note we give two explicit upper bounds for $R(K\_{[k\_1,t\_1]},\dots, K\_{[k\_r,t\_r]})$ (the…

In this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min-$k$-planar if, for every crossing in the drawing, at least one of the two crossing edges involves at…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Fix a positive integer $r$, and a graph $G$ that is $K_{3,r}$-minor-free. Let $I_s$ and $I_t$ be two independent sets in $G$, each of size $k$. We begin with a ``token'' on each vertex of $I_s$ and seek to move all tokens to $I_t$, by…

We show that the complexity function $p_k(n)$ of a piecewise translation map conjugated to a minimal translation on the torus $\TT^k = \RR^k / \ZZ^k$ is at least $kn+1$ for every integer $n$.

The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on…

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

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…

For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…

We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a minimum size subset of elements of M whose removal reduces the rank of M by at least k. When M is a graphical matroid this problem is the…

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the…

For a finite collection of graphs ${\cal F}$, the \textsc{${\cal F}$-TM-Deletion} problem has as input an $n$-vertex graph $G$ and an integer $k$ and asks whether there exists a set $S \subseteq V(G)$ with $|S| \leq k$ such that $G…