The stability of finite sets in dyadic groups

We show that there is an absolute $c>0$ such that any subset of $\mathbb{F}_2^\infty$ of size $N$ is $O(N^{1-c})$-stable in the sense of Terry and Wolf. By contrast a size $N$ arithmetic progression in the integers is not $N$-stable.Comment: 9 pp; corrected some errors and expanded the introductio

A preservation theorem for theories without the tree property of the first kind

We prove that the NTP$_1$ property of a geometric theory $T$ is inherited by theories of lovely pairs and $H$-structures associated to $T$. We also provide a class of examples of nonsimple geometric NTP$_1$ theories

Natural models of theories of green points

We explicitly present expansions of the complex field which are models of the theories of green points in the multiplicative group case and in the case of an elliptic curve without complex multiplication defined over $\mathbb{R}$. In fact, in both cases we give families of structures depending on parameters and prove that they are all models of the theories, provided certain instances of Schanuel's conjecture or an analogous conjecture for the exponential map of the elliptic curve hold. In the multiplicative group case, however, the results are unconditional for generic choices of the parameters

Generic expansions and the group configuration theorem

We exhibit a connection between geometric stability theory and the classification of unstable structures at the level of simplicity and the $\mathrm{NSOP}_{1}$-$\mathrm{SOP}_{3}$ gap. Particularly, we introduce generic expansions $T^{R}$ of a theory $T$ associated with a definable relation $R$ of $T$, which can consist of adding a new unary predicate or a new equivalence relation. When $T$ is weakly minimal and $R$ is a ternary fiber algebraic relation, we show that $T^{R}$ is a well-defined $\mathrm{NSOP}_{4}$ theory, and use one of the main results of geometric stability theory, the \textit{group configuration theorem} of Hrushovski, to give an exact correspondence between the geometry of $R$ and the classification-theoretic complexity of $T^{R}$. Namely, $T^{R}$ is $\mathrm{SOP}_{3}$, and $\mathrm{TP}_{2}$ exactly when $R$ is geometrically equivalent to the graph of a type-definable group operation; otherwise, $T^{R}$ is either simple (in the predicate version of $T^{R}$) or $\mathrm{NSOP}_{1}$ (in the equivalence relation version.) This gives us new examples of strictly $\mathrm{NSOP}_{1}$ theories.Comment: 25 pages; 1 figur

Embedded Finite Models beyond Restricted Quantifier Collapse

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as interpreted vocabulary over an infinite domain: denoted in the past as embedded finite model theory. We extend the analysis of "collapse results": the ability to eliminate first-order quantifiers over the infinite domain in favor of quantification over the finite structure. We investigate several weakenings of collapse, one allowing higher-order quantification over the finite structure, another allowing expansion of the theory. We also provide results comparing collapse for unary signatures with general signatures, and new analyses of collapse for natural decidable theories