Related papers: Topological conjugations are not constructable

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

It is a question of Hochman whether any two one-dimensional topologically mixing subshifts of finite type (SFTs) with the same entropy are topologically conjugate when their periodic points are removed. We give a negative answer, in fact we…

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…

Based on Stokes' theorem we derive a non-holomorphic functional calculus for matrices, assuming sufficient smoothness near eigenvalues, corresponding to the size of related Jordan blocks. It is then applied to the complex conjugation…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.

We construct a function for almost-complex Riemannian manifolds. Non-vanishing of the function for the almost-complex structure implies the almost-complex structure is not integrable. Therefore the constructed function is an obstruction for…

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…

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…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

In this paper, we study the descriptive set theoretic complexity of the equivalence relation of conjugacy of Toeplitz subshifts of a residually finite group $G$. On the one hand, we show that if $G = \mathbb{Z}$, then topological conjugacy…

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

We show that the topological conjugacy relation of diffeomorphisms on any manifold of dimension at least 2 is not classifiable by countable structures. This answers a question of Foreman and Gorodetski. We also prove that $E_0$ is reducible…

In the field of the Jacobian conjecture it is well-known after Druzkowski that from a polynomial "cubic-homogeneous" mapping we can build a higher-dimensional "cubic-linear" mapping and the other way round, so that one of them is invertible…

We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…

In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show…

We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy…

We prove some constructive results that on first and maybe even on second glance seem impossible.

Using the same method we provide negative answers to the following questions: Is it possible to find real equations for complex polynomials in two variables up to topological equivalence (Lee Rudolph) ? Can two topologically equivalent…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…