Related papers: Bootstrapping partition regularity of linear syste…

The Feichtinger Conjecture, if true, would have as a corollary that for each set $E\subset \T$ and $\Lambda \subset \Z$, there is a partition $\Lambda_1,...,\Lambda_N$ of $\Z$ such that for each $1\le i \le N$, $\{\exp(2\pi i x\lambda):…

Let $\|\cdot\|_{\mathbf A}$ be a norm on $\mathbb C^m$ given by the formula $\|(z_1,\ldots,z_m)\|_{\mathbf A}=\|z_1A_1+\cdots+z_mA_m\|_{\rm op}$ for some choice of an $m$-tuple of $n\times n$ linearly independent matrices $\mathbf A=(A_1,…

A nonempty set $A\subset\mathbb{N}$ is $\ell$-strong Schreier if $\min A\geqslant \ell|A|-\ell+1$. We define a set of positive integers to be sparse if either the set has at most two numbers or the differences between consecutive numbers in…

Whereas in a coordinate-dependent setting the Euler-Lagrange equations establish necessary conditions for solving variational problems in which both the integrands of functionals and the resulting paths are assumed to be sufficiently…

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

We consider the problem of Robust PCA in the fully and partially observed settings. Without corruptions, this is the well-known matrix completion problem. From a statistical standpoint this problem has been recently well-studied, and…

We use the numerical conformal bootstrap to study six-dimensional $\mathcal{N}=(1,0)$ superconformal field theories with flavor symmetry $\mathfrak{so}_{4k}$. We present evidence that minimal $(D_k, D_k)$ conformal matter saturates the…

Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…

In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…

Let $K_{exp+}$ be the class of all structures $A$ such that the automorphism group of $A$ has at most $c n^{d n}$ orbits in its componentwise action on the set of $n$-tuples with pairwise distinct entries, for some constants $c,d$ with $d <…

Marcus, Spielman and Srivastava (Annals of Mathematics 2014) solved the Kadison--Singer Problem by proving a strong form of Weaver's conjecture: they showed that for all $\alpha > 0$ and all lists of vectors of norm at most $\sqrt{\alpha}$…

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…

Let $\mathfrak{a}$ be a proper ideal of a commutative noetherian ring $R$ and $d$ a positive integer. We answer Hartshorne's question on cofinite complexes completely in the cases $\mathrm{dim}R=d$ or $\mathrm{dim}R/\mathfrak{a}=d-1$ or…

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…

Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…

Kronecker product covariance structure provides an efficient way to modeling the inter-correlations of matrix-variate data. In this paper, we propose testing statistics for Kronecker product covariance matrix based on linear spectral…

We take into account a coagulation model that simulates a distinct kind of dynamics. In this model, two particles collide to produce a single particle, but the resulting particle decreases in size, allowing each particle to be fully…

We consider some coloring issues related to the famous Erd\H {o}s Discrepancy Problem. A set of the form $A_{s,k}=\{s,2s,\dots,ks\}$, with $s,k\in \mathbb{N}$, is called a \emph{homogeneous arithmetic progression}. We prove that for every…