Enumerating palindromes and primitives in rank two free groups.
From MaRDI portal
Publication:645235
DOI10.1016/J.JALGEBRA.2011.02.010zbMATH Open1237.20023arXiv0802.2731OpenAlexW2963909527MaRDI QIDQ645235FDOQ645235
Authors: Jane Gilman, Linda Keen
Publication date: 8 November 2011
Published in: Journal of Algebra (Search for Journal in Brave)
Abstract: Let be a rank two free group. A word in is {sl primitive} if it, along with another group element, generates the group. It is a {sl palindrome} (with respect to and ) if it reads the same forwards and backwards. It is known that in a rank two free group any primitive element is conjugate either to a palindrome or to the product of two palindromes, but known iteration schemes for all primitive words give only a representative for the conjugacy class. Here we derive a new iteration scheme that gives either the unique palindrome in the conjugacy class or expresses the word as a unique product of two unique palindromes. We denote these words by where is rational number expressed in lowest terms. We prove that is a palindrome if is even and the unique product of two unique palindromes if is odd. We prove that the pairs generate the group when . This improves the previously known result that held only for and both even. The derivation of the enumeration scheme also gives a new proof of the known results about primitives.
Full work available at URL: https://arxiv.org/abs/0802.2731
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- What does a basis of F(a,b) look like?
- Searching for the cusp
- The Modular Surface and Continued Fractions
- On the palindromic and primitive widths of a free group.
- Pleating coordinates for the Maskit embedding of the Teichmüller space of punctured tori
- An algorithm for 2-generator Fuchsian groups
- The geometry of Markoff numbers
- The geometry and spectrum of the one holed torus
- Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\)
- Primitives in the free group on two generators
- Non-euclidean geometry, continued fractions, and ergodic theory
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
- Title not available (Why is that?)
- Discreteness criteria and the hyperbolic geometry of palindromes
- Cutting sequences and palindromes.
- Primitive words and self-intersections of curves on surfaces generated by the Gilman-Maskit discreteness algorithm.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Palindromic primitives and palindromic bases in the free group of rank two.
Cited In (16)
- A remark on `Counting primitive elements in free groups' (by J. Burillo and E. Ventura).
- Combinatorial growth in the modular group
- Palindromic width of free nilpotent groups.
- On palindromic width of certain extensions and quotients of free nilpotent groups
- The non-Euclidean Euclidean algorithm
- Discreteness criteria and the hyperbolic geometry of palindromes
- Bowditch's Q-conditions and Minsky's primitive stability
- Reversing palindromic enumeration in rank-two free groups
- The primitive elements of the free group of rank two.
- Pattern recognition and minimal words in free groups of rank 2
- Winding and unwinding and essential intersections in \(\mathbb{H}^3\)
- Palindromic primitives and palindromic bases in the free group of rank two.
- Continued fractions with \(\mathrm{SL}(2, \mathbb{Z})\)-branches: combinatorics and entropy
- On some properties palindromes of automorphisms of a free group
- Palindromic width of finitely generated solvable groups.
- Cutting sequences and palindromes.
This page was built for publication: Enumerating palindromes and primitives in rank two free groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645235)