Related papers: Sylvester-Gallai type theorems for approximate col…

We prove a geometric local constancy theorem for affine Springer fibers in families of close local fields. Consequently, stable orbital integrals are locally constant in these families, and both the base change fundamental lemma and the…

Using a local analog of the Wiener-Levi theorem, we investigate the class of measures on Euclidean space with discrete support and spectrum. Also, we find a new sufficient conditions for a discrete set in Euclidean space to be a coherent…

We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…

A classical Theorem of Alexandrov states that the map associating its boundary to a convex polyhdedron of the 3-dimensional Euclidean space is a bijection from the set of convex polyhdedron up to congruence to the set of isometry classes of…

We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford…

We use algorithmic methods from online learning to explore some important objects at the intersection of model theory and combinatorics, and find natural ways that algorithmic methods can detect and explain (and improve our understanding…

In this paper we state two quantitative Sylvester-Gallai results for high degree curves. Moreover we give two constructions which show that these results are not trivial.

In this work, we propose and investigate stable high-order collocation-type discretisations of the discontinuous Galerkin method on equidistant and scattered collocation points. We do so by incorporating the concept of discrete least…

We consider the possibility that some supersymmetric gauge theories which are not asymptotically free can be governed by ultraviolet-stable fixed points. If this scenario can be realized, gaugino masses will exhibit power-law running with…

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…

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

Understanding complexity in fluid mechanics is a major problem that has attracted the attention of physicists and mathematicians during the last decades. Using the concept of renormalization in dynamics, we show the existence of a locally…

We give two new characterizations of ($\F_2$-linear) locally testable error-correcting codes in terms of Cayley graphs over $\F_2^h$: \begin{enumerate} \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ whose set of…

The main result of this article is that the component of the Alexeev-Koll\'{a}r-Shepherd-Barron moduli space of stable surfaces parameterizing stable degenerations of symmetric squares of curves is isomorphic to the moduli space of stable…

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…

The aim of this paper is to generalize some fixed point theorems in the class of convex contraction of order $m$ on a complete suprametric space. Then, we will prove that the class of convex contraction of order m is strong enough to…

We provide sufficient conditions for instability of the subgradient method with constant step size around a local minimum of a locally Lipschitz semi-algebraic function. They are satisfied by several spurious local minima arising in robust…

We characterize the permutations of $\mathbb{F}_q$ whose graph minimizes the number of collinear triples and describe the lexicographically-least one, affirming a conjecture of Cooper-Solymosi. This question is closely connected to…

For a recent new numerical method for computing so-called robust Pad\'e approximants through SVD techniques, the authors gave numerical evidence that such approximants are insensitive to perturbations in the data, and do not have so-called…

We give an exact criterion of a conjecture of L.M.Kelly to hold true which is stated as follows. If there is a finite family $\Sigma$ of mutually skew lines in $\mathbb{R}^l,l\geq 4$ such that the three dimensional affine span (hull) of…