Abstract
Let , let and let be the group generated by and . In this paper, we study the problem of determining when the group is not free for rational. We give a robust computational criterion which allows us to prove that if for then is non-free, with the possible exception of . In this latter case, we prove that the set of denominators for which is non-free has natural density . For a general numerator , we prove that the lower density of denominators for which is non-free has a lower bound Finally, we show that for a fixed , there are arbitrarily long sequences of consecutive denominators such that is non-free. The proofs of some of the results are computer assisted, and Mathematica code has been provided together with suitable documentation.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.