相关论文: The Arithmetical Complexity of Dimension and Rando…
Let $T_1,\ldots, T_m$ be a family of $d\times d$ invertible real matrices with $\|T_i\|<1/2$ for $1\leq i\leq m$. For ${\bf a}=(a_1,\ldots, a_m)\in \Bbb R^{md}$, let $\pi^{{\bf a}}:\; \Sigma=\{1,\ldots, m\}^{\Bbb N}\to \Bbb R^d$ denote the…
Even in spaces of formal power series is required a topology in order to legitimate some operations, in particular to compute infinite summations. Many topologies can be exploited for different purposes. Combinatorists and algebraists may…
We show that the set of absolutely normal numbers is $\mathbf \Pi^0_3$-complete in the Borel hierarchy of subsets of real numbers. Similarly, the set of absolutely normal numbers is $\Pi^0_3$-complete in the effective Borel hierarchy.
For integer $m\ge3$, we study the dynamical system $(\Lambda_m,\sigma_m)$ where $\Lambda_m$ is the set $\{w\in\{0,1\}^\mathbb{N}: w$ does not contain $0^m$ or $1^m\}$ and $\sigma_m$ is the shift map on $\{0,1\}^\mathbb{N}$ restricted to…
In this paper, we prove the identity $\dim_{\textrm H}(F)=d\cdot \dim_{\textrm H}(\alpha^{-1}(F))$, where $\dim_{\textrm H}$ denotes Hausdorff dimension, $F\subseteq \mathbb{R}^d$, and $\alpha:[0,1]\to [0,1]^d$ is a function whose…
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…
A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…
Let $\{x\_n\}\_{n\geq 0}$ be a sequence of $[0,1]^d$, $\{\lambda\_n\} \_{n\geq 0}$ a sequence of positive real numbers converging to 0, and $\delta>1$. Let $\mu$ be a positive Borel measure on $[0,1]^d$, $\rho\in (0,1]$ and $\alpha>0$.…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…
Let $\mathbb{Z}$ be the integer numbers, $\mathbb{k}$ an algebraically closed field, $\Lambda$ a finite dimensional $\mathbb{k}$-algebra, mod$\Lambda$ the category of finitely generated right modules, proj$\Lambda$ the full subcategory of…
Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…
We classify strongly homotopy Lie algebras - also called L-infinity algebras - of one even and two odd dimensions, which are related to $2|1$-dimensional $Z_2$-graded Lie algebras. What makes this case interesting is that there are many…
There is a general notion of the magnitude of an enriched category, defined subject to hypotheses. In topological and geometric contexts, magnitude is already known to be closely related to classical invariants such as Euler characteristic…
We study numerical integration of functions depending on an infinite number of variables. We provide lower error bounds for general deterministic linear algorithms and provide matching upper error bounds with the help of suitable multilevel…
Let $C$ be the attractor of the IFS $\{f_{d}(z) = (-n+i)^{-1}(z+d): d\in D\}$, $D\subset\{0, 1, \ldots, n^{2}\}$ and let $\dim$ denote the box-counting dimension. It is known that for all $\lambda\in[0, 1]$, that the set of complex numbers…
The purpose of this paper is to complete the proof of the following result. Let $0 < \beta \leq \alpha < 1$ and $\kappa > 0$. Then, there exists $\eta > 0$ such that whenever $A,B \subset \mathbb{R}$ are Borel sets with $\dim_{\mathrm{H}} A…