相关论文: Classification of automorphic conjugacy classes in…

We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We give a short proof of a theorem of Handel and Mosher stating that any finitely generated subgroup of $\text{Out}(F_N)$ either contains a fully irreducible automorphism, or virtually fixes the conjugacy class of a proper free factor of…

We determine when two almost automorphisms of a regular tree are conjugate. This is done by combining the classification of conjugacy classes in the automorphism group of a level-homogeneous tree by Gawron, Nekrashevych and Sushchansky and…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

The ellipticity graph of a free group $F$ was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of $F$, which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface.…

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…

We provide two alternative ways to determine the number of (bi-)twisted conjugacy classes in a finite group: one by counting certain irreducible characters and one by counting certain twisted conjugacy classes of other endomorphisms. In…

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F_2) of automorphisms of the rank two free group F_2 and show that it can be realized as a monoid in the group B_4 of…

We generalize the combinatorial approaches of Rapaport and Higgins--Lyndon to the Whitehead algorithm. We show that for every automorphism $\varphi$ of a free group $F$ and every word $u\in F$ there exists a finite multiset of words…

Indices of fixed point classes play a central role in Nielsen fixed point theory. Jiang-Wang-Zhang proved that for selfmaps of graphs and surfaces, the index of any fixed point class has an upper bound called its characteristic. In this…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

For an epimorphism pi of the free group F_n onto a finite group G write Gamma(G,pi) for the group of all automorphisms f of F_n for which pi*f = pi. This is called the standard congruence subgroup of Aut(F_n) associated to G and pi. In the…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

Let $G$ be a group. Two elements $x,y \in G$ are said to be in the same $z$-class if their centralizers in $G$ are conjugate within $G$. Consider $\mathbb F$ a perfect field of characteristic $\neq 2$, which has a non-trivial Galois…