Related papers: Automorphic orbits in free groups

We give a complete classification of the finite $2$-groups $G$ for which the automorphism group $\operatorname{Aut}(G)$ acting naturally on $G$ has three orbits. There are two infinite families and one additional group, of order $2^9$. All…

We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…

Let $F$ be a free group of positive, finite rank and let $\Phi\in Aut(F)$ be a polynomial-growth automorphism. Then $F\rtimes_\Phi\mathbb Z$ is strongly thick of order $\eta$, where $\eta$ is the rate of polynomial growth of $\phi$. This…

Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…

We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…

A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…

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…

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…

The main theorem of this document emulates, in the context of Out(F_r) theory, a mapping class group theorem (by H. Masur and J. Smillie) that determines precisely which index lists arise from pseudo-Anosov mapping classes. Since the ideal…

We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…

We study the dilatation of outer automorphisms of right-angled Artin groups. Given a right-angled Artin group defined on a simplicial graph: $A(\Gamma) = \langle V | E \rangle$ and an automorphism $\phi \in Out(A(\Gamma))$ there is a…

If H is a flat group of automorphisms of finite rank n of a totally disconnected, locally compact group G, then each orbit of H in the metric space B(G) of compact, open subgroups of G is quasi-isometric to n-dimensional euclidean space. In…

Let $G$ be a group. The orbits of the natural action of Aut$(G)$ on $G$ are called ``automorphism orbits'' of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. We prove that if $G$ is a soluble group with finite…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

It is known that a finite group with an automorphism $\varphi$ of coprime order has a soluble radical of $(|\varphi|,|C_G(\varphi)|)$-bounded Fitting height and index. We extend this classic result as follows. Let $f(x) = a_0 + a_1 \cdot x…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…

First, we study a descending filtration of the ring of Fricke characters of a free group consisting of ideals on which the automorphism group of a free group acts. Then using it, we define a descending filtration of the IA-automorphism…

In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…

In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…