Elliot Kaplan

Elliot Kaplan
McMaster University | McMaster · Department of Mathematics and Statistics

Doctor of Philosophy

About

21
Publications
1,081
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
40
Citations
Citations since 2017
19 Research Items
40 Citations
201720182019202020212022202302468101214
201720182019202020212022202302468101214
201720182019202020212022202302468101214
201720182019202020212022202302468101214

Publications

Publications (21)
Preprint
Full-text available
We prove a dichotomy for o-minimal fields $\mathcal{R}$, expanded by a $T$-convex valuation ring (where $T$ is the theory of $\mathcal{R}$) and a compatible monomial group. We show that if $T$ is power bounded, then this expansion of $\mathcal{R}$ is model complete (assuming that $T$ is), it has a distal theory, and the definable sets are geometric...
Preprint
Full-text available
We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a) : a \in A\text{ and }r_1+\cdots+r_m = t\}$ is eventually a polynomial in $t$ (we also give a multivariate versi...
Preprint
Full-text available
Let $T$ be an o-minimal theory extending the theory of real closed ordered fields. An $H_T$-field is a model $K$ of $T$ equipped with a $T$-derivation such that the underlying ordered differential field of $K$ is an $H$-field. We study $H_T$-fields and their extensions. Our main result is that if $T$ is power bounded, then every $H_T$-field $K$ has...
Article
In 2001, the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway’s ordered field ${\mathbf {No}}$ of surreal numbers was brought to the fore by the first author and employed to provide necessary and sufficient conditions for an ordered field (ordered $K$ -vector space) to be isomorphic to an initial subfield ( $K$ -subspace)...
Preprint
Full-text available
Let $T$ be a polynomially bounded o-minimal theory extending the theory of real closed ordered fields. Let $K$ be a model of $T$ equipped with a $T$-convex valuation ring and a $T$-derivation. If this derivation is continuous with respect to the valuation topology, then we call $K$ a $T$-convex $T$-differential field. We show that every $T$-convex...
Article
Let [Formula: see text] be a complete, model complete o-minimal theory extending the theory [Formula: see text] of real closed ordered fields in some appropriate language [Formula: see text]. We study derivations [Formula: see text] on models [Formula: see text]. We introduce the notion of a [Formula: see text]-derivation: a derivation which is com...
Preprint
Full-text available
In [15], the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway's ordered field $\mathbf{No}$ of surreal numbers was brought to the fore and employed to provide necessary and sufficient conditions for an ordered field (ordered $K$-vector space) to be isomorphic to an initial subfield ($K$-subspace) of $\mathbf{No}$, i.e. a...
Preprint
Full-text available
Let $T$ be a complete, model complete o-minimal theory extending the theory RCF of real closed ordered fields in some appropriate language $L$. We study derivations $\delta$ on models $\mathcal{M}\models T$. We introduce the notion of a $T$-derivation: a derivation which is compatible with the $L(\emptyset)$-definable $\mathcal{C}^1$-functions on $...
Preprint
Full-text available
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function $f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that accepts precisely the set of base $r \in \mathbb{N}$ representations of elements of the graph of $f$. We show that a continuous $r$-regular function $f$ is locally affine away from a nowhere dense, Lebes...
Preprint
Full-text available
We define the field L of logarithmic hyperseries, construct on L natural operations of differentiation, integration, and composition, establish the basic properties of these operations, and characterize these operations uniquely by such properties.
Preprint
We define the field $\mathbb{L}$ of logarithmic hyperseries, construct on $\mathbb{L}$ natural operations of differentiation, integration, and composition, establish the basic properties of these operations, and characterize these operations uniquely by such properties.
Preprint
This paper proposes a new setup for studying pairs of structures. This new framework includes many of the previously studied classes of pairs, such as dense pairs of o-minimal structures, lovely pairs, fields with Mann groups, and $H$-structures, but also includes new ones, such as pairs consisting of a real closed field and a pseudo real closed su...
Article
Full-text available
We show that the theory $T_{\log}$ of the asymptotic couple of the field of logarithmic transseries is distal. As distal theories are NIP (= the non-independence property), this provides a new proof that $T_{\log}$ is NIP. Finally, we show that $T_{\log}$ is not strongly NIP, and in particular, it is not $\operatorname{dp}$-minimal and it does not...
Article
Full-text available
In [16], the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway’s ordered field No of surreal numbers was brought to the fore and employed to provide necessary and sufficient conditions for an ordered field to be isomorphic to an initial subfield of No , i.e., a subfield of No that is an initial subtree of No . In this sequ...
Article
Full-text available
In [15], the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway's ordered field No of surreal numbers was brought to the fore and employed to provide necessary and sufficient conditions for an ordered field to be isomorphic to an initial subfield of No, i.e. a subfield of No that is an initial subtree of No. In this sequel...
Article
Full-text available
The depth of a link measures the minimum height of a resolving tree for the link whose leaves are all unlinks. We show that the depth of the closure of a strictly positive braid word is the length of the word minus the number of distinct letters.

Network

Cited By