相关论文: Interlacing Families III: Sharper Restricted Inver…

Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…

In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…

The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

We use a recently found method to characterise all the invertible fourth-order difference equations linear in the extremal values based on the existence of a discrete Lagrangian. We also give some result on the integrability properties of…

In order to test if an unknown matrix has a given rank (null hypothesis), we consider the family of statistics that are minimum squared distances between an estimator and the manifold of fixed-rank matrix. Under the null hypothesis, every…

It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…

Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension, and also in higher dimensions if the map happens to be Markov. In general, the nonconformality of multidimensional intermittent maps represents a challenge that…

We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they…

We study the (trace) norm of a linearly invariant family in the ball in $\C$. By adapting an approach that in one variable yields optimal results, we are able to derive an upper bound for the norm of the family in terms of the Schwarzian…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an $m\times n$ rank $r$ matrix from $p < mn$ number of linear measurements. The…

The Zariski closure of the boundary of the set of matrices of nonnegative rank at most 3 is reducible. We give a minimal generating set for the ideal of each irreducible component. In fact, this generating set is a Grobner basis with…

For an $N \times N$ matrix $A$, its rank-$r$ rigidity, denoted $\mathcal{R}_A(r)$, is the minimum number of entries of $A$ that one must change to make its rank become at most $r$. Determining the rigidity of interesting explicit families…

We study the stability with respect to perturbations and the accuracy of numerical algorithms for computing solutions to the multilinear PageRank problem $\mathbf{x} = (1-\alpha)\mathbf{v} + \alpha \mathcal{P} \mathbf{x}^2$. Our results…

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

We study strategies for increasing the precision in the blurring models by maintaining a complexity in the related numerical linear algebra procedures (matrix-vector product, linear system solution, computation of eigenvalues etc.) of the…

The restricted invertibility theorem was originally introduced by Bourgain and Tzafriri in $1987$ and has been considered as one of the most celebrated theorems in geometry and analysis. In this note, we present weighted versions of this…

We develop a new technique for studying ranks of multiplication maps for linear series via limit linear series and degenerations to chains of genus-1 curves. We use this approach to prove a purely elementary criterion for proving cases of…