Thompson's group F is 1-counter graph automatic

Murray Elder 1  and Jennifer Taback 2
  • 1 School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan NSW 2308, Australia
  • 2 Department of Mathematics, Bowdoin College, Brunswick, ME 04011, USA

Abstract

It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to 𝒞-graph automatic by the authors, a compelling question is whether F is graph automatic or 𝒞-graph automatic for an appropriate language class 𝒞. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements.

  • 1

    D. Berdinsky and B. Khoussainov, On automatic transitive graphs, Developments in Language Theory, Lecture Notes in Comput. Sci. 8633, Lecture Notes in Comput. Sci. (2014), 1–12.

  • 2

    K. S. Brown and R. Geoghegan, An infinite-dimensional torsion-free FPF group, Invent. Math. 77 (1984), 2, 367–381.

  • 3

    J. Burillo, Quasi-isometrically embedded subgroups of Thompson's group F, J. Algebra 212 (1999), 1, 65–78.

  • 4

    J. W. Cannon, W. J. Floyd and W. R. Parry, Introductory notes on Richard Thompson's groups, Enseign. Math. (2) 42 (1996), 3–4, 215–256.

  • 5

    S. Cleary, S. Hermiller, M. Stein and J. Taback, Tame combing and almost convexity conditions, Math. Z. 269 (2011), 3–4, 879–915.

  • 6

    S. Cleary and J. Taback, Seesaw words in Thompson's group F, Geometric Methods in Group Theory, Contemp. Math. 372, American Mathematical Society, Providence (2005), 147–159.

  • 7

    M. Elder, A context-free and a 1-counter geodesic language for a Baumslag–Solitar group, Theoret. Comput. Sci. 339 (2005), 2–3, 344–371.

  • 8

    M. Elder and J. Taback, 𝒞-graph automatic groups, J. Algebra 413 (2014), 289–319.

  • 9

    D. B. A. Epstein, J. W. Cannon, D. F. Holt, S. V. F. Levy, M. S. Paterson and W. P. Thurston, Word Processing in Groups, Jones and Bartlett, Boston, 1992.

  • 10

    S. A. Greibach, Remarks on blind and partially blind one-way multicounter machines, Theoret. Comput. Sci. 7 (1978), 3, 311–324.

  • 11

    V. S. Guba and M. V. Sapir, The Dehn function and a regular set of normal forms for R. Thompson's group F, J. Aust. Math. Soc. Ser. A 62 (1997), 3, 315–328.

  • 12

    O. Kharlampovich, B. Khoussainov and A. Miasnikov, From automatic structures to automatic groups, Groups Geom. Dyn. 8 (2014), 1, 157–198.

  • 13

    V. Shpilrain and A. Ushakov, Thompson's group and public key cryptography, Applied Cryptography and Network Security, Lecture Notes in Comput. Sci. 3531, Springer, Berlin (2005), 151–163.

  • 14

    J. Taback and S. Younes, Tree-based language complexity of Thompson's group F, Groups Complex. Cryptol. 7 (2015), 2, 135–152.

Purchase article
Get instant unlimited access to the article.
Log in
Already have access? Please log in.


or
Log in with your institution

Journal + Issues

Groups – Complexity – Cryptology is a journal for speedy publication of articles in the areas of combinatorial and computational group theory, computer algebra, complexity theory, and cryptology. GCC primarily publishes research papers, but comprehensive and timely survey articles on a topic inside the scope of the journal are also welcome.

Search