Related papers: Model-theoretic Elekes-Szab\'o for stable and o-mi…

We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and characterise the complex algebraic varieties without power saving. The characterisation involves certain algebraic subgroups of commutative algebraic groups…

We prove a generalizations of the Elekes-Szab\'o theorem for relations definable in strongly minimal structures that are interpretable in distal structures.

The `global' Zarankiewicz problem for hypergraphs asks for an upper bound on the number of edges of a finite $r$-hypergraph $V$ in terms of the number $|V|$ of its vertices, assuming the edge relation is induced by a fixed $K_{k, \dots,…

We study the notion of linear sofic approximations for algebras, analogous to the concept of sofic representations for groups. We prove that for a finitely generated amenable $K$-algebra with no zero divisors, all linear sofic…

We show that with a suitable weak notion of general position, the Elekes-Szab\'o condition on the group operation of a connected complex algebraic group characterises nilpotence of the group. Along the way, we prove a Mordell-Lang result…

We study the orchard problem on cubic surfaces. We classify possibly reducible cubic surfaces $X\subseteq \mathbb{P}^3(\C)$ with smooth components on which there exist families of finite sets (of unbounded size) with quadratically many…

We consider when finite families $F \subseteq \mathbb{C}[t]$ of bounded degree polynomials, or more generally of bounded complexity finite-to-finite correspondences on $\mathbb{C}$, can exhibit non-expansion of the form $|F(A)| =…

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…

Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…

Let $K$ be a henselian valued field with ${\cal O}_K$ its valuation ring, $\Gamma$ its value group, and $\boldsymbol{k}$ its residue field. We study the definable subsets of ${\cal O}_K$ and algebraic groups definable over ${\cal O}_K$ in…

We work over an o-minimal expansion of a real closed field. The o-minimal homotopy groups of a definable set are defined naturally using definable continuous maps. We prove that any two semialgebraic maps which are definably homotopic are…

Celebrated results often unfold like episodes in a long-running series. In the field of extremal set thoery, Erd\H{o}s, Ko, and Rado in 1961 established that any $k$-uniform intersecting family on $[n]$ has a maximum size of…

Erd\H{o}s-Ko-Rado (EKR) type theorems yield upper bounds on the sizes of families of sets, subject to various intersection requirements on the sets in the family. Stability versions of such theorems assert that if the size of a family is…

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

A version of the Riesz-Sobolev convolution inequality is formulated and proved for arbitrary compact connected Abelian groups. Maximizers are characterized and a quantitative stability theorem is proved, under natural hypotheses. A…

In 1965, Erd\H{o}s and P\'{o}sa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter…

We introduce and systematically study linear sofic groups and linear sofic algebras. This generalizes amenable and LEF groups and algebras. We prove that a group is linear sofic if and only if its group algebra is linear sofic. We show that…

We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…