Related papers: Matrix rigidity and the Croot-Lev-Pach lemma
The growing complexity of dynamical systems and advances in data collection necessitates robust data-driven control strategies without explicit system identification and robust synthesis. Data-driven stability has been explored in linear…
This paper investigates asymptotic fixed point results for nonlinear contractions, with emphasis on Kirk-type theorems and their generalizations. A central difficulty in the literature has been the requirement that the mapping possesses a…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
We are concerned with an approximation problem for a symmetric positive semidefinite matrix due to motivation from a class of nonlinear machine learning methods. We discuss an approximation approach that we call {matrix ridge…
In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…
Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…
The Matrix Element Method is a promising multi-variate analysis tool which offers an optimal approach to compare theory and experiment according to the Neyman-Pearson lemma. However, until recently its usage has been limited by the fact…
This paper considers the robustness of an uncertain nonlinear system along a finite-horizon trajectory. The uncertain system is modeled as a connection of a nonlinear system and a perturbation. The analysis relies on three ingredients.…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…
Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of…
We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.
The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…
Let $\Gamma$ be a weakly irreducible higher rank lattice. In this paper, we will prove various rigidity results for the $\Gamma$-action following a philosophy of the Zimmer program. We provide new rigidity results including local and global…
The reachability problem in vector addition systems is a central question, not only for the static verification of these systems, but also for many inter-reducible decision problems occurring in various fields. The currently best known…
For a compact Riemannian manifold with boundary, endowed with a magnetic potential $\alpha$, we consider the problem of restoring the metric $g$ and the magnetic potential $\alpha$ from the values of the Ma\~n\'e action potential between…
In this paper, we consider the equilibrium problems and also their regularized problems under the setting of Hadamard spaces. The solution to the regularized problem is represented in terms of resolvent operators. As an essential machinery…