Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups

References

• Bestvina, M., Feighn, M. (1992). A combination theorem for negatively curved groups. J. Differential Geom. 35(1):85–101. doi:10.4310/jdg/1214447806
   Web of Science ®Google Scholar
• Blufstein, M. A., Minian, E. G. (2019). Strictly systolic angled complexes and hyperbolicity of one-relator groups. arXiv:1907.06738v1.
   Google Scholar
• Blufstein, M. A., Minian, E. G., Costa, I. S. Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility. arXiv:2006.13779v1. doi:10.1017/prm.2021.7
   Google Scholar
• Calegari, D., Walker, A. (2014). scallop, computer program. https://github.com/aldenwalker/scallop.
   Google Scholar
• Cashen, C. H., Manning, J. F. (2015). Virtual geometricity is rare. LMS J. Comput. Math. 18(1): 444–455.
   Google Scholar
• Chalk, C. (2020). Fibonacci groups, F(2, n), are hyperbolic for n odd and n>=11, arXiv:2005.10653v1.
   Google Scholar
• Cooper, B., and Rowland, E. (2015). Classification of automorphic conjugacy classes in the free group on two generators. Algorithmic problems of group theory, their complexity, and applications to cryptography. Contemp. Math. Vol. 633, Providence, RI: Amer. Math. Soc.; pp. 13–40.
   Google Scholar
• Duncan, A. J., Howie, J. (1991). The genus problem for one-relator products of locally indicable groups. Math. Z. 208(2):225–237. DOI: doi.org/10.1007/BF02571522
   Web of Science ®Google Scholar
• The GAP Group. (2019). GAP – Groups, Algorithms, and Programming, version 4.10.2. https://www.gap-system.org.
   Google Scholar
• Gardam, G., and Woodhouse, D. J. (2019). The geometry of one-relator groups satisfying a polynomial isoperimetric inequality Proc. Amer. Math. Soc. 147(1): 125–129. doi:10.1090/proc/14238
   Web of Science ®Google Scholar
• Gersten, S. M., and Short, H. B. Small cancellation theory and automatic groups. Invent. Math. 102(2):305–334. doi:10.1007/BF01233430
   Web of Science ®Google Scholar
• Gupta, N., Kapovich, I. (2019). The primitivity index function for a free group, and untangling closed curves on hyperbolic surfaces. Math. Proc. Cambridge Philos. Soc. 166)(1):83–121, With an appendix by Khalid Bou-Rabee. doi:10.1017/S0305004117000755
   Web of Science ®Google Scholar
• Heuer, N. (2019). Constructions in stable commutator length and bounded cohomology, Ph.D. thesis, University of Oxford.
   Google Scholar
• Hoffmann, C. (2020). Generalisations of small cancellation: The RSym algorithm on hyperbolic one-relator groups, Master’s thesis, University of Vienna.
   Google Scholar
• Holt, D. (2000). kbmag – Knuth-Bendix on monoids and automatic groups. Available at: http://homepages.warwick.ac.uk/mareg/download/kbmag2/.
   Google Scholar
• Holt, D., Linton, S.,Neunhoeffer, M., Parker, R., Pfeiffer, M., and C. M. (2019). Roney-Dougal, Polynomial-time proofs that groups are hyperbolic arXiv:1905.09770v1.
   Google Scholar
• Ivanov, S. V., Schupp, P. E. (1998). On the hyperbolicity of small cancellation groups and one-relator groups. Trans. Amer. Math. Soc. 350(5): 1851–1894. doi:10.1090/S0002-9947-98-01818-2
   Web of Science ®Google Scholar
• Kapovich, I., and Myasnikov, A. (2002). Stallings foldings and subgroups of free groups. J. Algebra 248(2): 608–668. doi:10.1006/jabr.2001.9033
   Web of Science ®Google Scholar
• Kapovich, I., Schupp, P. (2005). Genericity, the Arzhantseva-Ol′shanskii method and the isomorphism problem for one-relator groups. Math. Ann. 331(1): 1–19. doi:10.1007/s00208-004-0570-x
   Web of Science ®Google Scholar
• Kapovich, I., Schupp, P., Shpilrain, V. (2006). Generic properties of Whitehead’s algorithm and isomorphism rigidity of random one-relator groups. Pacific J. Math. 223(1):113–140.
   Web of Science ®Google Scholar
• Khan, B. (2004). The structure of automorphic conjugacy in the free group of rank two. In Computational and experimental group theory. Contemp. Math., Vol. 349, Providence, RI: Amer. Math. Soc.; pp. 115–196.
   Google Scholar
• Lee, D. (2006). Counting words of minimum length in an automorphic orbit. J. Algebra 301(1):35–58. doi:10.1016/j.jalgebra.2006.04.012
   Web of Science ®Google Scholar
• Lee, D. (2006). A tighter bound for the number of words of minimum length in an automorphic orbit. J. Algebra 305(2):1093–1101. doi:10.1016/j.jalgebra.2006.03.038
   Web of Science ®Google Scholar
• Louder, L., Wilton, H. (2018). Negative immersions for one-relator groups, arXiv:1803.02671v1.
   Google Scholar
• J. McCool and A. Pietrowski, On a conjecture of W. Magnus, Word problems: decision problems and the Burnside problem in group theory (Conf., Univ. California, Irvine, Calif. 1969; dedicated to Hanna Neumann), 1973, pp. 453–456. Studies in Logic and the Foundations of Math., Vol. 71.
   Google Scholar
• Myasnikov, A. G., Shpilrain, V. (2003). Automorphic orbits in free groups. J. Algebra 269(1): 18–27. doi:10.1016/S0021-8693(03)00339-9
   Web of Science ®Google Scholar
• Newman, B. B. (1968). Some results on one-relator groups. Bull. Amer. Math. Soc. 74:568–571. doi:10.1090/S0002-9904-1968-12012-9
   Web of Science ®Google Scholar
• Pérez, F., Granger, B. E. (2007). IPython: a system for interactive scientific computing. Comput. Sci. Eng. 9(3):21–29. doi:10.1109/MCSE.2007.53
   Web of Science ®Google Scholar
• Pfeiffer, M. (2019). walrus - a GAP package, version 0.99. https://www.gap-system.org/Packages/walrus.html.
   Google Scholar
• Puder, D. (2014). Primitive words, free factors and measure preservation. Israel J. Math. 201(1):25–73. doi:10.1007/s11856-013-0055-2
   Web of Science ®Google Scholar
• Stallings, J. R. (1983). Topology of finite graphs. Invent. Math. 71(3):551–565.
   Web of Science ®Google Scholar
• Whitehead, J. H. C. (1936). On equivalent sets of elements in a free group. Ann. of Math. (2) 37(4):782–800. doi:10.2307/1968618
   Google Scholar