Related papers: The regularity lemma is false over small fields
We provide (high probability) bounds on the condition number of random feature matrices. In particular, we show that if the complexity ratio $\frac{N}{m}$ where $N$ is the number of neurons and $m$ is the number of data samples scales like…
Let L be a number field and let E be any subgroup of the units O_L^* of L. If rank(E) = 1, Lehmer's conjecture predicts that the height of any non-torsion element of E is bounded below by an absolute positive constant. If rank(E) =…
Give deterministic necessary and sufficient conditions to guarantee that if a subspace fits certain partially observed data from a union of subspaces, it is because such data really lies in a subspace. Furthermore, Give deterministic…
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…
The celebrated theorem of Komlos asserts that L1-boundedness is sufficient for a given sequence of functions to contain a subsequence along which (in a "lacunary" manner), and along whose every further subsequence ("hereditarily"), a strong…
A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our main motivation is that their constructions, as well as…
Superstring/M-theory compactified on compact Ricci flat manifolds have recently been conjectured to exhibit instabilities whenever the metrics do not have special holonomy. We use worldsheet conformal field theory to investigate…
Melchior's inequality implies that the average line-length in a simple, rank-$3$, real-representable matroid is less than $3$. A similar result holds for complex-representable matroids, using Hirzebruch's inequality, but with a weaker bound…
A matrix $A\in \mathbb{R}^{m \times n}$ is strictly sign regular/SSR (or sign regular/SR) if for each $1 \leq k \leq \min\{m,n\}$, all (non-zero) $k\times k$ minors of $A$ have the same sign. This class of matrices contains the totally…
In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\alpha}$ then some…
The Matrix Spencer Conjecture asks whether given $n$ symmetric matrices in $\mathbb{R}^{n \times n}$ with eigenvalues in $[-1,1]$ one can always find signs so that their signed sum has singular values bounded by $O(\sqrt{n})$. The standard…
Stated lemma contains the assertions about isomorphism of exact m-forms and exterior differentials of regular m-maps, of linearly harmonic m-forms and exterior differentials of regular harmonic m-maps, of global minimal (n-m)-surfaces and…
The world of primes has many gaps between evidence and theorems. Here, we review Legendre's conjecture on primes between consecutive squares and recent progress on the weaker question of primes between consecutive larger powers. Assuming…
Criteria for defining errors of a physical theory are formulated. It is shown that the Special Theory of Relativity (STR) has a solid mathematical basis. An enormous amount of experiments carried out in particle physics use beams of…
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…
The Standard Model is the low-energy limit of a microscopic theory which includes extra dimensions and new symmetries. A part of my thesis consisted in constructing a new class of models with two extra dimensions. We showed that these…
In 1933, Rado conjectured that for any positive integer n, there is always a linear homogeneous equation with degree of regularity n. In proving this conjecture, Alexeev and Tsimerman, and independently Golowich, found that some equations…
An inequality proved firstly by Remak and then generalized by Friedman shows that there are only finitely many number fields with a fixed signature and whose regulator is less than a prescribed bound. Using this inequality, Astudillo, Diaz…
Large language models (LLMs) are increasingly used as decision-support tools in data-constrained scientific workflows, where correctness and validity are critical. However, evaluation practices often emphasize stability or reproducibility…
We prove a `resilience' version of Dirac's theorem in the setting of random regular graphs. More precisely, we show that, whenever $d$ is sufficiently large compared to $\varepsilon>0$, a.a.s. the following holds: let $G'$ be any subgraph…