Related papers: On the Structure of Sets with Few Three-Term Arith…

A partial group with $n+1$ elements is, when regarded as a symmetric simplicial set, of dimension at most $n$. This dimension is $n$ if and only if the partial group is a group. As a consequence of the first statement, finite partial groups…

In this paper we define the $p$-density of a finite subset $D\subset\ma{N}^r$, and show that it gives a good lower bound for the $p$-adic valuation of exponential sums over finite fields of characteristic $p$. We also give an application:…

Let R be a sufficiently saturated o-minimal expansion of a real closed field, let O be the convex hull of the rationals in R, and let st: O^n \to \mathbb{R}^n be the standard part map. For X \subseteq R^n define st(X):=st(X \cap O^n). We…

The distinct dot products problem, a variant of the Erd\H{o}s distinct distances problem, asks "Given a set $P_n$ of $n$ points in $\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?" The best…

The main purpose is to establish two theorems about closed 0-definable subsets $A$ of an affine space $K^{n}$ over a Hensel minimal field $K$. The first, being a non-Archimedean counterpart of one from o-minimal geometry, states that every…

We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space is O(1/r).

We show some basic facts about dp-minimal ordered structures. The main results are : dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure…

Given natural numbers $k \leq s \leq n$, we ask: what is the minimal VC-dimension of a family $\mathcal{F}$ of $s$-subsets of $[n]$ that covers all $k$-subsets of $[n]$? We first show that for sufficiently large $n$ this number is always…

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

This paper studies the structure of core sets under different similarity classes. We investigate the influence of factors of the minimal polynomial with different degrees on the structure of core sets. When $F$ is a finite field of prime…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

We show that subsets of $\mathbb{F}_q^{\infty}$ of large Fourier dimension must contain three-term arithmetic progressions. This contrasts with a construction of Shmerkin of a subset of $\mathbb{R}$ of Fourier dimension $1$ with no…

Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…

Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…

We study d-minimal expansions of ordered fields, and dense pairs thereof. We also consider other generalizations of o-minimality.

Suppose that we are given a string $s$ of length $n$ over an alphabet $\{0,1,\ldots,n^{O(1)}\}$ and $\delta$ is the string complexity of $s$, a known compression measure. We describe an index on $s$ with $O(\delta\log\frac{n}{\delta})$…

For any subshift, define $F_X(n)$ to be the collection of distinct follower sets of words of length $n$ in $X$. Based on a similar result of the second and third authors, we conjecture that if there exists an $n$ for which $|F_X(n)| \leq…