Related papers: Non computable Mandelbrot-like set for a one-param…

We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.

In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a…

Given $b=-A\pm i$ with $A$ being a positive integer, we can represent any complex number as a power series in $b$ with coefficients in $\mathcal A=\{0,1,\ldots, A^2\}$. We prove that, for any real $\tau\geq 2$ and any non-empty proper…

Let $f(z) = z+z^2+O(z^3)$ and $f_\epsilon(z) = f(z) + \epsilon^2$. A classical result in parabolic bifurcation in one complex variable is the following: if $N-\frac{\pi}{\epsilon}\to 0$ we obtain $(f_\epsilon)^{N} \to \mathcal{L}_f$, where…

Let $\bm p_0,...,\bm p_{m-1}$ be points in ${\mathbb R}^d$, and let $\{f_j\}_{j=0}^{m-1}$ be a one-parameter family of similitudes of ${\mathbb R}^d$: $$ f_j(\bm x) = \lambda\bm x + (1-\lambda)\bm p_j, j=0,...,m-1, $$ where…

It is well known that a commuting family of diagonalizable linear operators on a finite dimensional vector space is simultaneously diagonalizable. In this paper, we consider a family A of anti-commuting (complex) linear operators on a…

We describe a primary limb structure in the connectedness locus of complex cubic polynomials, where the limbs are indexed by the periodic points of the doubling map $t \mapsto 2t \ (\operatorname{mod} {\mathbb Z})$. The main renormalization…

Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We study critical orbits and bifurcations within the moduli space of quadratic rational maps on $\mathbb{P}^1$. We focus on the family of curves, $Per_1(\lambda)$ for $\lambda$ in $\mathbb{C}$, defined by the condition that each $f\in…

We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…

We investigate with the help of Clifford algebraic methods the Mandelbrot set over arbitrary two-component number systems. The complex numbers are regarded as operator spinors in D\times spin(2) resp. spin(2). The thereby induced (pseudo)…

We show that, consistently, there exists a Borel set B subset Cantor admitting a sequence (eta_alpha:alpha<lambda) of distinct elements of Cantor such that (eta_alpha+B) cap (eta_beta+B) is uncountable for all alpha,beta<lambda but with no…

In this paper we give a complete classification of two-step nilpotent Leibniz algebras in terms of Kronecker modules associated with pairs of bilinear forms. In particular, we describe the complex and the real case of the indecomposable…

We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1$ is a computable real, and if $\Omega$ is a nonzero, non-atomic, and separable measure space, then every…

A topological ring R, an escape set B in R and a family of maps z^d+c defines the degree d Mandelstuff as the set of parameters for which the closure of the orbit of 0 does not intersect R. If B is the complement of a ball of radius 2 in C…

We study a new connection between multidimensional continued fractions, such as Jacobi--Perron algorithm, and additively indecomposable integers in totally real cubic number fields. First, we find the indecomposables of all signatures in…

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…

We exhibit a countably infinite family of simple, separable, nuclear, and mutually non-isomorphic C*-algebras which agree on K-theory and traces. The algebras do not absorb the Jiang-Su algebra Z tensorially, answering a question of N. C.…

We prove a priori bounds for Feigenbaum quadratic polynomials, i.e., infinitely renormalizable polynomials $f_c: z\mapsto z^2+c$ of bounded type. It implies local connectivity of the corresponding Julia sets $J(f_c)$ and MLC (local…