Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Automorphisms of Free groups"”.
-
Pseudo-Aanosov automorphisms of free groups
… problem: Given a homeomorphism <em>f</em> of a surface <em>S</em>, we determine fixed points and periodic points of <em>f</em>. We also compute the index of fixed points. Furthermore, if <em>f</em> is a pseudo- Anosov homeomorphism, we illustrate the dynamics of <em>f</em> by finding two …
-
Palindromic automorphisms of free groups and rigidity of automorphism groups of right-angled Artin groups
Let F_n denote the free group of rank n with free basis X. The palindromic automorphism group PiA_n of F_n consists of automorphisms taking each member of X to a palindrome: that is, a word on X that reads the same backwards as forwards. We obtain finite generating sets for certain stabiliser …
-
Combinatorial models for surface and free group symmetries
The curve complex of Harvey allows combinatorial representation of a surface mapping class group by describing its action on simple closed curves. Similar complexes of spheres, free factors, and free splittings allow combinatorial representation of the automorphisms of a free group. We consider a …
-
Algorithmic Problems in Automorphic Orbits of Free Groups
One of the fundamental problems in the field of combinatorial group theory is telling when two group presentations represent isomorphic groups. Since applying a free group automorphism to the set of relators of a presentation gives an isomorphic group, we want to be able to quickly decide when …
-
Groups acting on graphs: Their automorphisms and their length functions
<p class="MsoNormal">Actions on frees are powerful tools for understanding the structure of a group and its automorphisms. In this thesis, we generalise several existing results in this field to larger classes of groups.<br/><br/>This is a three paper thesis; the main body of the work is contained …
-
Whitehead's Decision Problems for Automorphisms of Free Group
Let F be a free group of finite rank. Given words u, v ∈ F, J.H.C. Whitehead solved the decision problem of finding an automorphism φ ∈ Aut(F), carrying u to v. He used topological methods to produce an algorithm. Higgins and Lyndon gave a very concise proof of the problem based on the works of …