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.

生成讲解博客的中文版本

生成AI智能校验的中文版本