Searcharxiv⌕ Search

arXiv subjects

Gabriel Conant

Publications and source records attributed to Gabriel Conant.

33 records · Page 2Linked to original sources
arXiv2019

Weakly minimal groups with a new predicate

Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all formulas in the expansion $(\mathcal{M}^*,A)$ are equivalent to bounded formulas, and so $(\mathcal{M},A)$ is stable (or NIP) if and only if the $\mathcal{M}$-induced structure $A_{\mathcal{M}}$ on $A$ is stable (or NIP). We then restrict to the case that $\mathcal{M}$ is a pure abelian group with a weakly minimal theory, and $A_{\mathcal{M}}$ is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of $(\mathbb{Z},+)$. Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form $(\mathcal{M},A)$. Most notably, we show that if $(G,+)$ is a weakly minimal additive subgroup of the algebraic numbers, $A\subseteq G$ is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of $A$ is a root of unity, then $(G,+,B)$ is superstable for any $B\subseteq A$.

math.LO↗
arXiv2019

Remarks on generic stability in independent theories

In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic stability for types coincides with the notion of a frequency interpretation measure. We also give combinatorial examples of types in NSOP theories that are finitely approximated but not generically stable, as well as $ϕ$-types in simple theories that are definable and finitely satisfiable in a small model, but not finitely approximated. Our proofs demonstrate interesting connections to classical results from Ramsey theory for finite graphs and hypergraphs.

math.LO↗
arXiv2019

Independence in generic incidence structures

We study the theory $T_{m,n}$ of existentially closed incidence structures omitting the complete incidence structure $K_{m,n}$, which can also be viewed as existentially closed $K_{m,n}$-free bipartite graphs. In the case $m = n = 2$, this is the theory of existentially closed projective planes. We give an $\forall\exists$-axiomatization of $T_{m,n}$, show that $T_{m,n}$ does not have a countable saturated model when $m,n\geq 2$, and show that the existence of a prime model for $T_{2,2}$ is equivalent to a longstanding open question about finite projective planes. Finally, we analyze model theoretic notions of complexity for $T_{m,n}$. We show that $T_{m,n}$ is NSOP$_1$, but not simple when $m,n\geq 2$, and we show that $T_{m,n}$ has weak elimination of imaginaries but not full elimination of imaginaries. These results rely on combinatorial characterizations of various notions of independence, including algebraic independence, Kim independence, and forking independence.

math.LO↗
arXiv2018

Extending partial isometries of generalized metric spaces

We consider generalized metric spaces taking distances in an arbitrary ordered commutative monoid, and investigate when a class $\mathcal{K}$ of finite generalized metric spaces satisfies the Hrushovski extension property: for any $A\in\mathcal{K}$ there is some $B\in\mathcal{K}$ such that $A$ is a subspace of $B$ and any partial isometry of $A$ extends to a total isometry of $B$. Our main result is the Hrushovski property for the class of finite generalized metric spaces over a semi-archimedean monoid $\mathcal{R}$. When $\mathcal{R}$ is also countable, this can be used to show that the isometry group of the Urysohn space over $\mathcal{R}$ has ample generics. Finally, we prove the Hrushovski property for classes of integer distance metric spaces omitting triangles of uniformly bounded odd perimeter. As a corollary, given odd $n\geq 3$, we obtain ample generics for the automorphism group of the universal, existentially closed graph omitting cycles of odd length bounded by $n$.

math.LO↗
arXiv2018

Stability and sparsity in sets of natural numbers

Given a set $A\subseteq\mathbb{N}$, we consider the relationship between stability of the structure $(\mathbb{Z},+,0,A)$ and sparsity of the set $A$. We first show that a strong enough sparsity assumption on $A$ yields stability of $(\mathbb{Z},+,0,A)$. Such sets include examples considered by Palacín and Sklinos and Poizat, many classical linear recurrence sequences (e.g. the Fibonaccci numbers), and any set in which the limit of ratios of consecutive elements diverges. Finally, we consider sparsity conclusions on sets $A\subseteq\mathbb{N}$, which follow from model theoretic assumptions on $(\mathbb{Z},+,0,A)$. We use a result of Erdős, Nathanson, and Sárközy to show that if $(\mathbb{Z},+,0,A)$ does not define the ordering on $\mathbb{Z}$, then the lower asymptotic density of any finitary sumset of $A$ is zero. Finally, in a theorem communicated to us by Goldbring, we use a result of Jin to show that if $(\mathbb{Z},+,0,A)$ is stable, then the upper Banach density of any finitary sumset of $A$ is zero.

math.LO↗
arXiv2018

Multiplicative structure in stable expansions of the group of integers

We define two families of expansions of $(\mathbb{Z},+,0)$ by unary predicates, and prove that their theories are superstable of $U$-rank $ω$. The first family consists of expansions $(\mathbb{Z},+,0,A)$, where $A$ is an infinite subset of a finitely generated multiplicative submonoid of $\mathbb{N}$. Using this result, we also prove stability for the expansion of $(\mathbb{Z},+,0)$ by all unary predicates of the form $\{q^n:n\in\mathbb{N}\}$ for some $q\in\mathbb{N}_{\geq 2}$. The second family consists of sets $A\subseteq\mathbb{N}$ which grow asymptotically close to a $\mathbb{Q}$-linearly independent increasing sequence $(λ_n)_{n=0}^\infty\subseteq\mathbb{R}^+$ such that $\{\frac{λ_n}{λ_m}:m\leq n\}$ is closed and discrete.

math.LO↗
arXiv2018

Neostability in countable homogeneous metric spaces

Given a countable, totally ordered commutative monoid $\mathcal{R}=(R,\oplus,\leq,0)$, with least element $0$, there is a countable, universal and ultrahomogeneous metric space $\mathcal{U}_\mathcal{R}$ with distances in $\mathcal{R}$. We refer to this space as the $\mathcal{R}$-Urysohn space, and consider the theory of $\mathcal{U}_\mathcal{R}$ in a binary relational language of distance inequalities. This setting encompasses many classical structures of varying model theoretic complexity, including the rational Urysohn space, the free $n^{\text{th}}$ roots of the complete graph (e.g. the random graph when $n=2$), and theories of refining equivalence relations (viewed as ultrametric spaces). We characterize model theoretic properties of $\text{Th}(\mathcal{U}_\mathcal{R})$ by algebraic properties of $\mathcal{R}$, many of which are first-order in the language of ordered monoids. This includes stability, simplicity, and Shelah's SOP$_n$-hierarchy. Using the submonoid of idempotents in $\mathcal{R}$, we also characterize superstability, supersimplicity, and weak elimination of imaginaries. Finally, we give necessary conditions for elimination of hyperimaginaries, which further develops previous work of Casanovas and Wagner.

math.LO↗
arXiv2017

Stable groups and expansions of $(\mathbb{Z},+,0)$

We show that if $G$ is a sufficiently saturated stable group of finite weight with no infinite, infinite-index, chains of definable subgroups, then $G$ is superstable of finite $U$-rank. Combined with recent work of Palacin and Sklinos, we conclude that $(\mathbb{Z},+,0)$ has no proper stable expansions of finite weight. A corollary of this result is that if $P\subseteq\mathbb{Z}^n$ is definable in a finite dp-rank expansion of $(\mathbb{Z},+,0)$, and $(\mathbb{Z},+,0,P)$ is stable, then $P$ is definable in $(\mathbb{Z},+,0)$. In particular, this answers a question of Marker on stable expansions of the group of integers by sets definable in Presburger arithmetic.

math.LO↗
arXiv2017

Definable sets containing productsets in expansions of groups

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable subset $A$ of an expansion of a discrete amenable group such that $A$ has positive Banach density and the formula $x\cdot y\in A$ is stable. For arbitrary expansions of groups, we consider a "$1$-sided" version of the productset property, which is characterized in various ways using coheir independence. For stable groups, the productset property is equivalent to this $1$-sided version, and behaves as a notion of largeness for definable sets, which can be characterized by a natural weakening of model-theoretic genericity. Finally, we use recent work on regularity lemmas in distal theories to prove a definable version of the productset property for sets of positive Banach density definable in certain distal expansions of amenable groups.

math.LO↗
arXiv2016

Distance structures for generalized metric spaces

Let $\mathcal{R}=(R,\oplus,\leq,0)$ be an algebraic structure, where $\oplus$ is a commutative binary operation with identity $0$, and $\leq$ is a translation-invariant total order with least element $0$. Given a distinguished subset $S\subseteq R$, we define the natural notion of a "generalized" $\mathcal{R}$-metric space, with distances in $S$. We study such metric spaces as first-order structures in a relational language consisting of a distance inequality for each element of $S$. We first construct an ordered additive structure $\mathcal{S}^*$ on the space of quantifier-free $2$-types consistent with the axioms of $\mathcal{R}$-metric spaces with distances in $S$, and show that, if $A$ is an $\mathcal{R}$-metric space with distances in $S$, then any model of $\text{Th}(A)$ logically inherits a canonical $\mathcal{S}^*$-metric. Our primary application of this framework concerns countable, universal, and homogeneous metric spaces, obtained as generalizations of the rational Urysohn space. We adapt previous work of Delhommé, Laflamme, Pouzet, and Sauer to fully characterize the existence of such spaces. We then fix a countable totally ordered commutative monoid $\mathcal{R}$, with least element $0$, and consider $\mathcal{U}_\mathcal{R}$, the countable Urysohn space over $\mathcal{R}$. We show that quantifier elimination for $\text{Th}(\mathcal{U}_\mathcal{R})$ is characterized by continuity of addition in $\mathcal{R}^*$, which can be expressed as a first-order sentence of $\mathcal{R}$ in the language of ordered monoids. Finally, we analyze an example of Casanovas and Wagner in this context.

math.LO↗
arXiv2016

On the complexity of finite subgraphs of the curve graph

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to $\mathcal{P}_{g,p}$. We introduce a new invariant of a graph, the 'nested complexity length', which provides a novel obstruction to $\mathcal{P}_{g,p}$. For the curve graph this invariant captures the topological complexity of the surface in graph-theoretic terms; indeed we show that its value is $6g-6+2p$, i.e. twice the size of a maximal multicurve on the surface. As a consequence we show that large half-graphs do not have $\mathcal{P}_{g,p}$, and we deduce quantitatively that almost all finite graphs which pass the chromatic and clique tests do not have $\mathcal{P}_{g,p}$. We also reinterpret our obstruction in terms of the first-order theory of the curve graph, and in terms of RAAG subgroups of the mapping class group (following Kim and Koberda). Finally, we show that large multipartite subgraphs cannot have $\mathcal{P}_{g,p}$. This allows us to compute the upper density of the curve graph, and to conclude that clique size, chromatic number, and nested complexity length are not sufficient to determine $\mathcal{P}_{g,p}$.

math.GT↗
arXiv2016

A remark on strict independence relations

We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation to show that if $T$ is the theory of the Fraïssé limit of finite metric spaces with integer distances, then $T^{\text{eq}}$ has more than one strict independence relation. This answers a question of Adler [1, Question 1.7].

math.LO↗
arXiv2015

Model theoretic properties of the Urysohn sphere

We characterize model theoretic properties of the Urysohn sphere as a metric structure in continuous logic. In particular, our first main result shows that the theory of the Urysohn sphere is $\text{SOP}_n$ for all $n\geq 3$, but does not have the fully finite strong order property. Our second main result is a geometric characterization of dividing independence in the theory of the Urysohn sphere. We further show that this characterization satisfies the extension axiom, and so forking and dividing are the same for complete types. Our results require continuous analogs of several tools and notions in classification theory. While many of these results are undoubtedly known to researchers in the field, they have not previously appeared in publication. Therefore, we include a full exposition of these results for general continuous theories.

math.LO↗
arXiv2014

Forking and dividing in Henson graphs

For $n\geq 3$, define $T_n$ to be the theory of the generic $K_n$-free graph, where $K_n$ is the complete graph on $n$ vertices. We prove a graph theoretic characterization of dividing in $T_n$, and use it to show that forking and dividing are the same for complete types. We then give an example of a forking and nondividing formula. Altogether, $T_n$ provides a counterexample to a recent question of Chernikov and Kaplan.

math.LO↗