Reversing palindromic enumeration in rank-two free groups

From MaRDI portal
Publication:4976191




Abstract: The Gilman-Maskit algorithm for determining the discreteness or non-discreteness of a two-generator subgroup of mathrmPSL2mathbbR 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.









This page was built for publication: Reversing palindromic enumeration in rank-two free groups

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