Reversing Palindromic Enumeration in Rank Two Free Groups
Group Theory
2016-04-19 v4
Abstract
The Gilman-Maskit algorithm for determining the discreteness or non-discreteness of a two-generator subgroup of terminates with a pair of generators that are Farey words. The Farey words are primitive words that are indexed by rational numbers and infinity. The E-words, primitive words with palindromic product forms, are also indexed by rational numbers and infinity. We show a modification of the Gilman-Maskit algorithm so that the stopping generators are E-words.
Cite
@article{arxiv.1311.6358,
title = {Reversing Palindromic Enumeration in Rank Two Free Groups},
author = {Andrew E. Silverio},
journal= {arXiv preprint arXiv:1311.6358},
year = {2016}
}