Related papers: Computing fixed closures in free groups

We give an algorithm which computes the fixed subgroup and the stable image for any endomorphism of the free group of rank two $F_2$, answering for $F_2$ a question posed by Stallings in 1984 and a question of Ventura.

We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.

We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…

Let $G=\ast_{i=1}^{n}G_{i}$ and let $\phi$ be a symmetric endomorphism of $G$. If $\phi$ is a monomorphism or if $G$ is a finitely generated residually finite group, then the fixed subgroup $Fix(\phi)=\{g\in G:\phi(g)=g\}$ of $\phi$ has…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

Let \phi be an endomorphism of a finitely generated free group F, and let H be a finite-index subgroup of F that is invariant under \phi. The nonzero eigenvalues of \phi are contained in the eigenvalues of \phi restricted to H.

We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…

Last years a number of papers were devoted to describing automorphisms of semigroups of endomorphisms of free finitely generated universal algebras of some varieties: groups, semigroups, associative commutative algebras, inverse semigroups,…

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

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 show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

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…

A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…