Related papers: The group of reversible Turing machines: subgroups…

Let G be a torsion--free abelian group of finite rank. The automorphism group Aut(G) acts on the set of maximal independent subsets of G. The orbits of this action are the isomorphism classes of indecomposable decompositions of G. G…

The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…

Building on the work of Mann and Rafi, we introduce an expanded definition of a telescoping 2-manifold and proceed to study the homeomorphism group of a telescoping 2-manifold. Our main result shows that it is strongly distorted. We then…

The irreducible representations of all of the 80 diperiodic groups, being the symmetries of the systems translationally periodical in two directions, are calculated. To this end, each of these groups is factorized as the product of a…

We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any…

We prove that torsion subgroups of groups defined by C(6), C(4)-T(4) or C(3)-T(6) small cancellation presentations are finite cyclic groups. This follows from a more general result on the existence of fixed points for locally elliptic…

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

We study automaton groups without singular points, that is, points in the boundary for which the map that associates to each point its stabilizer, is not continuous. This is motivated by the problem of finding examples of infinite…

In this paper we give two families of non-metrizable topologies on the group of the integers having a countable dual group which is isomorphic to a infinite torsion subgroup of the unit circle in the complex plane. Both families are related…

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

A loop is automorphic if all its inner mappings are automorphisms. We construct a large family of automorphic loops as follows. Let $R$ be a commutative ring, $V$ an $R$-module, $E=\mathrm{End}_R(V)$ the ring of $R$-endomorphisms of $V$,…

A topological space is reversible if each continuous bijection of it onto itself is open. We introduce an analogue of this notion in the category of topological groups: A topological group G is g-reversible if every continuous automorphism…

Let $G$ be a group and let $X$ be an algebraic variety over an algebraically closed field $k$ of characteristic zero. Denote $A=X(k)$ the set of rational points of $X$. We investigate invertible algebraic cellular automata $\tau \colon A^G…

We construct finitely generated simple torsion-free groups with strong homological control. Our main result is that every subset of $\mathbb{N} \cup \{\infty\}$, with some obvious exceptions, can be realized as the set of dimensions of…

Among the fundamental questions in computer science, at least two have a deep impact on mathematics. What can computation compute? How many steps does a computation require to solve an instance of the 3-SAT problem? Our work addresses the…

The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of THAT group, and so on, iterating transfinitely. Each group maps canonically into the next using inner automorphisms, and so at…

We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…

A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite tapes (Master Tape, Synchro Tape, Backup Tape, Backup Synchro Tape, User Tape) and…

We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system…

We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $…