Related papers: Higher-order generalizations of stability and arit…

The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…

We show that a subset of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ is well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$ (denoting the complexities of the linear and quadratic part,…

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was…

We study the notions generic stability, regularity, homogeneous pregeometries, quasiminimality, and their mutual relations, in an arbitrary first order theory T. We prove that "infinite-dimensional homogeneous pregeometries" coincide with…

We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

Leveraging algorithmic stability to derive sharp generalization bounds is a classic and powerful approach in learning theory. Since Vapnik and Chervonenkis [1974] first formalized the idea for analyzing SVMs, it has been utilized to study…

We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle…

We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…

The homology groups of many natural sequences of groups $\{G_n\}_{n=1}^{\infty}$ (e.g. general linear groups, mapping class groups, etc.) stabilize as $n \rightarrow \infty$. Indeed, there is a well-known machine for proving such results…

We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

Subgroup stability is a strong notion of quasiconvexity that generalizes convex cocompactness in a variety of settings. In this paper, we characterize stability of a subgroup by properties of its limit set on the Morse boundary. Given…

We prove a general representation stability result for polynomial coefficient systems which lets us prove representation stability and secondary homological stability for many families of groups with polynomial coefficients. This gives two…

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

We study $\epsilon$-representations of discrete groups by unitary operators on a Hilbert space. We define the notion of Ulam stability of a group which loosely means that finite-dimensional $\epsilon$-represendations are uniformly close to…

We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…