Searcharxiv⌕ Search

arXiv subjects

Itay Kaplan

Publications and source records attributed to Itay Kaplan.

At least 19 recordsLinked to original sources
arXiv2025

Cofinal families of finite VC-dimension

Given infinite cardinals $\theta\leq \kappa$, we ask for the minimal VC-dimension of a cofinal family $\mathcal{F}\subseteq[\kappa]^{<\theta}$. We show that for $\theta=\omega$ and $\kappa=\aleph_n$ it is consistent with ZFC that there exists such a family of VC-dimension $n+1$, which is known to be the lower bound. For $\theta>\omega$ we answer this question completely, demonstrating a strong dichotomy between the case of singular and regular $\theta$. We furthermore answer some relative and generalized versions of the above question for singular $\theta$, and answer a related question which appears in \cite{BBNKS}.

math.LO↗
arXiv2024

Stable reducts of elementary extensions of Presburger arithmetic

Suppose $N$ is elementarily equivalent to an archimedean ordered abelian group $(G,+,<)$ with small quotients (for all $1 \leq n < \omega$, $[G: nG]$ is finite). Then every stable reduct of $N$ which expands $(G,+)$ (equivalently every reduct that does not add new unary definable sets) is interdefinable with $(G,+)$. This extends previous results on stable reducts of $(\mathbb{Z}, +, <)$ to (stable) reducts of elementary extensions of $\mathbb{Z}$. In particular this holds for $G = \mathbb{Z}$ and $G = \mathbb{Q}$. As a result we answer a question of Conant from 2018. This result is a corollary of a more general statement about expansions of weakly-minimal 1-based expansions of abelian groups with small quotients preserving the algebraic closure operator.

math.LO↗
arXiv2024

Infinite Cliques in Simple and Stable Graphs

Suppose that $G$ is a graph of cardinality $\mu^+$ with chromatic number $\chi(G)\geq \mu^+$. One possible reason that this could happen is if $G$ contains a clique of size $\mu^+$. We prove that this is indeed the case when the edge relation is stable. When $G$ is a random graph (which is simple but not stable), this is not true. But still if in general the complete theory of $G$ is simple, $G$ must contain finite cliques of unbounded sizes.

math.LO↗
arXiv2023

Automorphisms of the Rado meet-tree

We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"{\i}ss\'{e} limit over a finite relational language is simple. As a prototypical case, the group of automorphism of the Rado meet-tree (i.e. the Fra\"{\i}ss\'{e} limit of finite graphs which are also meet-trees) is simple.

math.LO↗
arXiv2023

Generic Stability Independence and Treeless theories

We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories contains both binary theories and stable theories and give several applications of the theory of independence for treeless theories. As a corollary, we show that every binary NSOP$_{3}$ theory is simple.

math.LO↗
arXiv2023

The model theory of geometric random graphs

We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$ provided the distance between them is bounded by some constant number. We prove that for a large class of metric spaces, including circles, spheres and the complete Urysohn space, almost all geometric random graphs on a given space are elementary equivalent. Moreover, their first-order theory can reveal geometric properties of the underlying metric space.

math.LO↗
arXiv2022

A definable $(p,q)$-theorem for NIP theories

We prove a definable version of Matoušek's $(p,q)$-theorem in NIP theories. This answers a question of Chernikov and Simon. We also prove a uniform version. The proof builds on a proof of Boxall and Kestner who proved this theorem in the distal case, utilizing the notion of locally compressible types which appeared in the work of the author with Bays and Simon.

math.LO↗
arXiv2022

Existentially closed models of fields with a distinguished submodule

This paper deals with the class of existentially closed models of fields with a distinguished submodule (over a fixed subring). In the positive characteristic case, this class is elementary and was investigated by the first-named author. Here we study this class in Robinson's logic, meaning the category of existentially closed models with embeddings following Haykazyan and Kirby, and prove that in this context this class is NSOP$_1$ and TP$_2$.

math.LO↗
arXiv2022

On algebraically closed fields with a distinguished subfield

This paper is concerned with the model-theoretic study of pairs $(K,F)$ where $K$ is an algebraically closed field and $F$ is a distinguished subfield of $K$ allowing extra structure. We study the basic model-theoretic properties of those pairs, such as quantifier elimination, model-completeness and saturated models. We also prove some preservation results of classification-theoretic notions such as stability, simplicity, NSOP$_1$, and NIP. As an application, we conclude that a PAC field is NSOP$_1$ iff its absolute Galois group is (as a profinite group).

math.LO↗
arXiv2022

On large externally definable sets in NIP

We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals.

math.LO↗
arXiv2022

Exact saturation in pseudo-elementary classes for simple and stable theories

We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals, satisfying mild set-theoretic hypotheses, which had previously been open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analogue of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories.

math.LO↗
arXiv2022

Boolean Types in Dependent Theories

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author's result about counting types, as well as the notion of a smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transferred to measures - in particular, giving an alternative proof of the fact that every measure in a dependent theory can be extended to a smooth one. We also study the stable case. We consider this paper as an invitation for more research into the topic of Boolean types.

math.LO↗
arXiv2021

Saturated Models for the Working Model Theorist

We put in print a classical result that states that for most purposes, there is no harm in assuming the existence of saturated models in model theory. The presentation is aimed for model theorists with only basic knowledge of axiomatic set theory.

math.LO↗
arXiv2021

Density of compressible types and some consequences

We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we obtain explicit uniform honest definitions for NIP formulas (answering a question of Eshel and the second author), and build compressible models in countable NIP theories.

math.LO↗
arXiv2021

Criteria for exact saturation and singular compactness

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give criteria for a theory to have singular compactness.

math.LO↗
arXiv2021

Infinite Stable Graphs With Large Chromatic Number II

We prove a version of the strong Taylor's conjecture for stable graphs: if $G$ is a stable graph whose chromatic number is strictly greater than $\beth_2(\aleph_0)$ then $G$ contains all finite subgraphs of Sh$_n(ω)$ and thus has elementary extensions of unbounded chromatic number. This completes the picture from our previous work. The main new model theoretic ingredient is a generalization of the classical construction of Ehrenfeucht-Mostowski models to an infinitary setting, giving a new characterization of stability.

math.LO↗
arXiv2021

Infinite Stable Graphs With Large Chromatic Number

We prove that if $G=(V,E)$ is an $ω$-stable (respectively, superstable) graph with $χ(G)>\aleph_0$ (respectively, $2^{\aleph_0}$) then $G$ contains all the finite subgraphs of the shift graph $\text{Sh}_n(ω)$ for some $n$. We prove a variant of this theorem for graphs interpretable in stationary stable theories. Furthermore, if $G$ is $ω$-stable with $\mathrm{U}(G)\leq 2$ we prove that $n\leq 2$ suffices.

math.LO↗