相关论文: Free-by-cyclic groups, automorphisms and actions o…
We give conditions of an extension of a free group to be hyperbolic and relatively hyperbolic using the dynamics of the action of $\out$ on the complex of free factors combined with the weak attraction theory. We work with subgroups of…
The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…
We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
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…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
Let T be a k-regular tree (k>2) and A its automorphism group. We analyze a generic finitely generated subgroup Gamma of A. We show that Gamma is free and establish a trichotomy on the closure of Gamma: it is either discrete, compact or has…
We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
We generalize the peak-reduction algorithm (Whitehead's theorem) for free groups to a theorem about a general right-angled Artin group A_Gamma. As an application, we find a finite presentation for the automorphism group Aut A_Gamma that…
We start by studying the distribution of (cyclically reduced) elements of the free groups with respect to their abelianization. We derive an explicit generating function, and a limiting distribution, by means of certain results (of…
Let $\Lambda_0$ be an ordered abelian group. We show how an $\mathrm{ATF}(\mathbb{Z}\times\Lambda_0)$ group -- that is, a group admitting a free affine action without inversions on a $\mathbb{Z}\times\Lambda_0$-tree -- admits a natural…
We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…
We introduce the concept of cyclicity and hypercyclicity in self-similar groups as an analogue of cyclic and hypercyclic vectors for an operator on a Banach space. We derive a sufficient condition for cyclicity of non-finitary automorphisms…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.
We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…