Related papers: Asymptotic density and the coarse computability bo…

We establish sufficient conditions for the asymptotic normality of kernel density estimators, applied to causal linear random fields. Our conditions on the coefficients of linear random fields are weaker than known results, although our…

We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…

The minimum positive co-degree of a nonempty $r$-graph $H$, denoted by $\delta_{r-1}^+(H)$, is the largest integer $k$ such that for every $(r-1)$-set $S \subset V(H)$, if $S$ is contained in a hyperedge of $H$, then $S$ is contained in at…

A reduction of properties (invariants) of compact sets of real numbers to properties of countable orders is presented here. Discussed here is also an embedding property of some compact sets that are called t$\mathbb R$-sets. Among others,…

"How much c.e. sets could cover a given set?" in this paper we are going to answer this question. Also, in this approach some old concepts come into a new arrangement. The major goal of this article is to introduce an appropriate definition…

Uniformity and proximity are two different ways for defining small scale structures on a set. Coarse structures are large scale counterparts of uniform structures. In this paper, motivated by the definition of proximity, we develop the…

We generalize the notions of asymptotic dimension and coarse embeddings from metric spaces to quantum metric spaces in the sense of Kuperberg and Weaver. We show that quantum asymptotic dimension behaves well with respect to metric…

A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…

The omega limit sets plays a fundamental role to construct global attractors for topological semi-dynamical systems with continuous time or discrete time. Therefore, it is important to know when omega limit sets become nonempty compact…

We propose a conjecture on the density of arithmetic points in the deformation space of representations of the \'etale fundamental group in positive characteristic. This? conjecture has applications to \'etale cohomology theory, for example…

We show that $z\in\R^n$ is computably random if and only if every computable monotone function on $\R^n$ is differentiable at $z$.

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…

We show that if $G$ is an amenable topological group, then the topological group $L^{0}(G)$ of strongly measurable maps from $([0,1],\lambda)$ into $G$ endowed with the topology of convergence in measure is whirly amenable, hence extremely…

The goals of this paper are to obtain theoretical models of what happens when a computer calculates the rotation set of a homeomorphism, and to find a good algorithm to perform simulations of this rotation set. To do that we introduce the…

Let $A$ be the product of an abelian variety and a torus defined over a number field $K$. Fix some prime number $\ell$. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…

We give a short proof of the $L^{1}$ criterion for Beurling generalized integers to have a positive asymptotic density. We actually prove the existence of density under a weaker hypothesis. We also discuss related sufficient conditions for…