Related papers: An arithmetic algebraic regularity lemma

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…

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…

The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemer{\'e}di regularity lemma in graph theory. It shows that for any abelian group $G$ and any bounded function $f:G \to [0,1]$, there exists a subgroup…

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 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…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

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 continue our earlier study of finite dimensional definable groups in models of the the model companion of an o-minimal L-theory T expanded by a generic derivation as in [F-K]. We generalize Buium's notion of an algebraic D-group to…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

Let G be a Chevalley group scheme and B<=G a Borel subgroup scheme, both defined over Z. Let K be a global function field, S be a finite non-empty set of places over K, and O_S be the corresponding S-arithmetic ring. Then, the S-arithmetic…

Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

We prove the following instance of a conjecture stated in arXiv:1103.4770. Let $G$ be an abelian semialgebraic group over a real closed field $R$ and let $X$ be a semialgebraic subset of $G$. Then the group generated by $X$ contains a…

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…

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…