Abstract
We consider the family of irreducible cyclically presented groups on n generators whose generating word (in the standard rewrite) has length at most 15. Using the software packages KBMAG, quotpic and MAGMA, together with group and number theoretic methods, we show that if 6 ≤ n ≤ 100 then the group is non-trivial. In an appendix we list the 47 cases within 2 ≤ n ≤ 100 for which we know the group to be trivial, and 27 further cases for which triviality has yet to be determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
