Skip to main content
SpringerLink
Log in

On Automatic Transitive Graphs

  • Conference paper
Developments in Language Theory (DLT 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8633))

Included in the following conference series:

Abstract

We study infinite automatic transitive graphs. In particular we investigate automaticity of certain Cayley graphs. We provide examples of infinite automatic transitive graphs that are not Cayley graphs. We prove that Cayley graphs of Baumslag–Solitar groups and the restricted wreath products of automatic transitive graphs with ℤ are automatic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baumslag, G., Solitar, D.: Some two-generator one-relator non-Hopfian groups. Bulletin of American Mathematical Society 68, 199–201 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cleary, S., Taback, J.: Dead end words in lamplighter groups and other wreath products. Quarterly Journal of Mathematics 56, 165–178 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Deistel, R., Leader, I.: A conjecture concerning a limit of non–Cayley graphs. Journal of Algebraic Combinatorics 14(1), 17–25 (2001)

    Article  MathSciNet  Google Scholar 

  4. Delhommé, C.: Automaticité des ordinaux et des graphes homogènes. Comptes Rendus Mathematique 339(1), 5–10 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Barlett Publishers, Boston (1992)

    MATH  Google Scholar 

  6. Erschler, A.: Generalized wreath products. International Mathematics Research Notices Article ID 57835, 1–14 (2006)

    Google Scholar 

  7. Eskin, A., Fisher, D., Whyte, K.: Quasi-isometries and rigidity of solvable groups. arXiv:math/0511647v3 [math.GR] (2006)

    Google Scholar 

  8. Gromov, M.: Asymptotic invariants of infinite groups. In: Niblo, A., Roller, M.A. (eds.) Geometric Group Theory, Vol. 2. London Math. Soc. Lecture Note Ser., vol. 182, Cambridge Univ. Press, Cambridge (1993)

    Google Scholar 

  9. Kargapolov, M.I., Merzljakov, J.I.: Fundamentals of the theory of groups. Springer, Heidelberg (1979)

    Book  MATH  Google Scholar 

  10. Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. arXiv:1107.3645v2 [math.GR] (2011)

    Google Scholar 

  11. Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995), http://dx.doi.org/10.1007/3-540-60178-3_93

    Chapter  Google Scholar 

  12. Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Logical Methods in Computer Science 3(2:2), 1–18 (2007)

    MathSciNet  Google Scholar 

  13. Lyndon, R.C., Schupp, P.E.: Combinatorial group theory. Springer, Heidelberg (1977)

    Book  MATH  Google Scholar 

  14. Oliver, G.P., Thomas, R.M.: Automatic presentations for finitely generated groups. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 693–704. Springer, Heidelberg (2005), http://dx.doi.org/10.1007/978-3-540-31856-9_57

    Chapter  Google Scholar 

  15. Thomassen, C., Watkins, M.E.: Infinite vertex-transitive, edge-transitive, non-1-transitive graphs. Proceedings of American Mathematical Society 105(1), 258–261 (1989)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Auckland, Princes St., 38, 1010, Auckland, New Zealand

    Dmitry Berdinsky & Bakhadyr Khoussainov

Authors
  1. Dmitry Berdinsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bakhadyr Khoussainov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Ural Federal University, pr. Lenina, 51, 620000, Ekaterinburg, Russia

    Arseny M. Shur  & Mikhail V. Volkov  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Berdinsky, D., Khoussainov, B. (2014). On Automatic Transitive Graphs. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09698-8_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09697-1

  • Online ISBN: 978-3-319-09698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation