Related papers: A note on test elements for monomorphisms of free …
A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…
A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…
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…
We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…
In this article, for a polyadic group(G,f),derived from group G by automorphism G and element b, we give a necessary and sufficient condition in terms of the group, the automorphism G, and the element b, in order that the polyadic group…
The automorphism group of a finitely generated free group is the normal closure of a single element of order 2. If $m$ is less than $n$ then a homomorphism $Aut(F_n)\to Aut(F_m)$ can have cardinality at most 2. More generally, this is true…
We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…
Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.
An endomorphism of a free group is called primitivity preserving if it takes every primitive element to another primitive. In this paper we prove that every primitivity preserving endomorphism of a free group of a finite rank n > 2 is an…
We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
In the 1970s Stallings showed that one could learn a great deal about free groups and their automorphisms by viewing the free groups as fundamental groups of graphs and modeling their automorphisms as homotopy equivalences of graphs.…
We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…
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…
Every two seeds in a field of fractions $\mathcal{F}$ together with a symmetric group element gives rise to an automorphism of $\mathcal{F}$ called an exchange automorphism. For positive cluster algebras, we provide equivalent conditions…
We prove that in a torsion-free hyperbolic group, an element is a test element if and only if it is not contained in a proper retract.
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
We develop a refinement of Whitehead's algorithm for primitive words in a free group. We generalize to subgroups, establishing a strengthened version of Whitehead's algorithm for free factors. We make use of these refinements in proving new…