Growing words in the free group on two generators.

zbMATH Open1279.20037arXiv0909.0561MaRDI QIDQ351749FDOQ351749

Authors: Bobbe Cooper, Eric Rowland 

Publication date: 10 July 2013

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Abstract: This paper is concerned with minimal-length representatives of equivalence classes of words in F_2 under Aut F_2. We give a simple inequality characterizing words of minimal length in their equivalence class. We consider an operation that "grows" words from other words, increasing the length, and we study root words -- minimal words that cannot be grown from other minimal words. Root words are "as minimal as possible" in the sense that their characterization is the boundary case of the minimality inequality. The property of being a root word is respected by equivalence classes, and the length of each root word is divisible by 4.

Full work available at URL: https://arxiv.org/abs/0909.0561

Recommendations

• On the genericity of Whitehead minimality
• PRODUCTS OF COMMUTATORS IN FREE GROUPS
• On several problems about automorphisms of the free group of rank two.
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• Counting words of minimum length in an automorphic orbit.
• scientific article; zbMATH DE number 8769
• Classification of automorphic conjugacy classes in the free group on two generators.
• On Jordan's theorem for complex linear groups
• scientific article; zbMATH DE number 88884
• Pattern recognition and minimal words in free groups of rank 2

zbMATH Keywords

free groupsword lengthsautomorphic orbitsequivalent words under automorphismsminimal wordsWhitehead algorithm

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Generators, relations, and presentations of groups (20F05) Combinatorics on words (68R15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Minimal words in the free group of rank two
• Automorphic orbits in free groups.
• Counting words of minimum length in an automorphic orbit.
• On equivalent sets of elements in a free group
• Title not available (Why is that?)
• Equivalence of Elements Under Automorphisms of a Free Group
• On Certain Sets of Elements in a Free Group
• On free groups and their automorphisms
• A tighter bound for the number of words of minimum length in an automorphic orbit.

Cited In (5)

• Counting words of minimum length in an automorphic orbit.
• Structure of words with short 2-length in a free product of groups
• Stability of Numerical Invariants in Free Groups
• A tighter bound for the number of words of minimum length in an automorphic orbit.
• FREE GROUP ROOTS OF a^kb^l AND [ a^k,b]

This page was built for publication: Growing words in the free group on two generators.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351749)