Reversing palindromic enumeration in rank-two free groups

From MaRDI portal
Publication:4976191

DOI10.1080/10586458.2016.1180655zbMATH Open1400.20025arXiv1311.6358OpenAlexW2295454066MaRDI QIDQ4976191FDOQ4976191


Authors: Andrew E. Silverio Edit this on Wikidata


Publication date: 27 July 2017

Published in: Experimental Mathematics (Search for Journal in Brave)

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.


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




Recommendations




Cites Work


Cited In (1)





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)