相关论文: Every group has a terminating transfinite automorp…

A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

We present a general framework for automatic continuity results for groups of isometries of metric spaces. In particular, we prove automatic continuity property for the group of isometries of the Urysohn space and the Urysohn sphere, i.e.…

A tubular group is a group that acts on a tree with $\mathbb{Z}^2$ vertex stabilizers and $\mathbb{Z}$ edge stabilizers. This paper develops further a criterion of Wise and determines when a tubular group acts freely on a finite dimensional…

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…

We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily…

Let $G$ be an infinite simple group of finite Morley rank and $\alpha$ a supertight automorphism of $G$ so that the fixed point subgroup $P_n:=C_G(\alpha^n)$ is pseudofinite for all $n\in \mathbb{N}\setminus\{0\}$. It is know (using CFSG)…

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism…

Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus…

Given a construction $f$ on groups, we say that a group $G$ is \textit{$f$-realisable} if there is a group $H$ such that $G\cong f(H)$, and \textit{completely $f$-realisable} if there is a group $H$ such that $G\cong f(H)$ and every…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…

We prove that the outer automorphism group of a free group of countably infinite rank is complete.

Let $G$ be a finite $p$-group of nilpotency class 2. We find necessary and sufficient conditions on $G$ such that each central automorphism of $G$ fixes the center of $G$ element-wise.

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…