Related papers: A structure theorem for sets with doubling $4+\del…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…
Stickelberger proved that the discriminant of a number field is congruent to 0 or 1 modulo 4. We generalize this to an arbitrary (not necessarily commutative) ring of finite rank over the integers using techniques from linear algebra. Our…
We have provided a pure model-theoretic proof for the decidability of the additive structure of the integers together with the function {f} sending {x} to {[\phi x]} where {\phi} is the golden ratio.
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we…
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
Let A be a finite subset of the integers or, more generally, of any abelian group, written additively. The set A has "more sums than differences" if |A+A|>|A-A|. A set with this property is called an MSTD set. This paper gives explicit…
We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…
We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…
Let $(G,+)$ be a finite abelian group. Then, $\so(G)$ and $\eta(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has a subsequence whose terms sum to $0$ and whose length is equal to and at…
We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…
We prove that if $A \subseteq [X, 2X]$ and $B \subseteq [Y, 2Y]$ are sets of integers such that $\gcd(a,b) \geq D$ for at least $\delta |A||B|$ pairs $(a,b) \in A \times B$ then $|A||B| \ll_{\varepsilon} \delta^{-2 - \varepsilon} XY/D^2$.…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.
We completely characterize point--line configurations with $\Theta(n^{4/3})$ incidences when the point set is a section of the integer lattice. This can be seen as the main special case of the structural Szemer\'edi-Trotter problem. We also…
We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…