相关论文: Conjugacy for certain automorphisms of the one-sid…

Let $1 \le r < n$ be integers. We give a proof that the group $\mathop{\mathrm{Aut}}({X_{n}^{\mathbb{N}}, \sigma_{n}})$ of automorphisms of the one-sided shift on $n$ letters embeds naturally as a subgroup $\mathcal{H}_{n}$ of the outer…

In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…

An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…

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 article, we solve the twisted conjugacy problem for solvable Baumslag--Solitar groups $BS(n,1)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(n,1)$ and an automorphism $\varphi \in \Aut(BS(n,1))$, decides…

Let $\sigma$ denote the shift automorphism on $\mathcal{P}(\omega) / \mathrm{fin}$, defined by setting $\sigma([A]) = [A+1]$ for all $A \subseteq \omega$. We show that the Continuum Hypothesis implies the shift automorphism $\sigma$ and its…

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…

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

In this article, we further explore the nature of a connection between the groups of automorphisms of full shift spaces and the groups of outer automorphisms of the Higman--Thompson groups $\{G_{n,r}\}$. We show that the quotient of the…

Automorphism groups are intrincate conjugacy invariants for subshifts, which can reveal important features of the dynamical structure of a shift action. One important case is the study of automorphism groups when the underlying subshift has…

We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying…

Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…

The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

Given a homeomorphism $T \colon X \to X$ of a compact metric space $X$, the stabilized automorphism group $\textrm{Aut}^{\infty}(T)$ of the system $(X,T)$ is the group of self-homeomorphisms of $X$ which commute with some power of $T$. We…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

In this paper we study the conjugacy relation on one-sided subshifts in the viewpoint of descriptive set theory. We show the conjugacy relation on one sided subshifts with the alphabet set $\{0,1\}$ is non-treeable and non-amenable.

The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…