Related papers: Notes on the DPRM property for listable structures

Let $M$ be a finite von Neumann algebra (resp. a type II$_{1}$ factor) and let $N\subset M$ be a II$_{1}$ factor (resp. $N\subset M$ have an atomic part). We prove that the inclusion $N\subset M$ is amenable implies the identity map on $M$…

We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…

Let $K$ be a number field, let $L$ be an algebraic (possibly infinite degree) extension of $K$, and let $O_K$ $\subset$ $O_L$ be their rings of integers. Suppose $A$ is an abelian variety defined over $K$ such that $A(K)$ is infinite and…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

We prove a quantitative partial result in support of the Dynamical Mordell-Lang Conjecture (also known as the DML conjecture) in positive characteristic. More precisely, we show the following: given a field $K$ of characteristic $p$, given…

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

Let K be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map.…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

We prove that almost every finite collection of matrices in $GL_d(\mathbb{R})$ and $SL_d(\mathbb{R})$ with positive entries is Diophantine. Next we restrict ourselves to the case $d=2$. A finite set of $SL_2(\mathbb{R})$ matrices induces a…

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that an object with required…

In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

We extend results of Denef, Zahidi, Demeyer and the second author to show the following. (1) Rational integers have a single-fold Diophantine definition over the ring of integral functions of any function field of characteristic 0. (2)…

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

We give some comments on W.M. Schmidt's theorem on Diophantine approximations with positive integers and our recent results on the topic.

We give an example of a definable quotient in an o-minimal structure which cannot be eliminated over any set of parameters, giving a negative answer to a question of Eleftheriou, Peterzil, and Ramakrishnan. Equivalently, there is an…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…