Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm

Ilya Kapovich, Mark C. Bell. Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm. Experimental Mathematics, 28(1):24-38, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.