Related papers: The regularity lemma is false over small fields

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

In the presence of arbitrarily large magnetic fields, matter composed of electrons and nuclei was known to be unstable if $\alpha$ or $Z$ is too large. Here we prove that matter {\it is stable\/} if $\alpha<0.06$ and $Z\alpha^2<0.04$.

For a set $X$ of $N$ points in $\mathbb{R}^D$, the Johnson-Lindenstrauss lemma provides random linear maps that approximately preserve all pairwise distances in $X$ -- up to multiplicative error $(1\pm \epsilon)$ with high probability --…

It is proved that if $I$ and $J$ are weakly stable ideals in a polynomial ring $R=k[x_1,\ldots,x_n]$, with $k$ a field, then the regularity of $\text{Tor}^R_i(R/I,R/J)$ has the expected upper bound. We also give a bound for the regularity…

It is almost always easier to find an accurate-but-complex model than an accurate-yet-simple model. Finding optimal, sparse, accurate models of various forms (linear models with integer coefficients, decision sets, rule lists, decision…

This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical audience.

Chebotarev's theorem on roots of unity states that all minors of the Fourier matrix of prime size are non-vanishing. This result has been rediscovered several times and proved via different techniques. We follow the proof of Evans and…

Chen and Ye recently proved that the analytic rank of tensors is stable under field extensions, assuming a fixed base field. Using a more careful analysis, we show that this assumption is unnecessary.

One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…

When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…

We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse…

The main goal of this paper is to present a new algorithm bounding the regularity and ``alpha'' (the lowest degree of existing hypersurface) of a linear system of hypersurfaces (in $\mathbb P^n$) passing through multiple points in general…

The Hardy--Littlewood inequalities for $m$-linear forms have their origin with the seminal paper of Hardy and Littlewood (Q.J. Math, 1934). Nowadays it has been extensively investigated and many authors are looking for the optimal estimates…

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…

Szemeredi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering…

We study the regularity problem of the nonlinear sigma model with gravitino fields in higher dimensions. After setting up the geometric model, we derive the Euler--Lagrange equations and consider the regularity of weak solutions defined in…

Let $\mathbb{F}_q$ be the finite field of order $q$, and $\mathcal{A}$ a non-empty proper subset of $\mathbb{F}_q$. Let $\mathbf{M}$ be a random $m \times n$ matrix of rank $r$ over $\mathbb{F}_q$ taken with uniform distribution. It was…

Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…

This paper investigates regularity properties of two non-negative sparsity sets: non-negative sparse vectors, and low-rank positive semi-definite matrices. Novel formulae for their Mordukhovich normal cones are given and used to formulate…

Type II string theory and M-theory admit flux configurations that break supersymmetry below the Kaluza-Klein scale. These backgrounds play a central role in most models of the string landscape. I argue that the behavior of such backgrounds…