Skip to main content
SpringerLink
Log in

The conjugacy problem for the automorphism group of the random graph

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Becker H., Kechris A.S.: The descriptive set theory of Polish group actions, volume 232 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  2. Camerlo R., Gao S.: The completeness of the isomorphism relation for countable Boolean algebras. Trans. Am. Math. Soc. 353(2), 491–518 (2001) (electronic)

    Article  MATH  MathSciNet  Google Scholar 

  3. Foreman, M.: A descriptive view of ergodic theory. In: Descriptive set theory and dynamical systems (Marseille-Luminy, 1996), volume 277 of London Mathematical Society Lecture Note Series, pp. 87–171. Cambridge University Press, Cambridge (2000)

  4. Friedman H., Stanley L.: A Borel reducibility theory for classes of countable structures. J. Symb. Logic 54(3), 894–914 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Glass, A.M.W.: Ordered permutation groups, volume 55 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1981)

  6. Hjorth G., Kechris A.S.: Borel equivalence relations and classifications of countable models. Ann. Pure Appl. Logic 82(3), 221–272 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Macpherson D., Woodrow R.: The permutation group induced on a moiety. Forum Math. 4(3), 243–255 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Truss J.K.: The group of the countable universal graph. Math. Proc. Cambridge Philos. Soc. 98(2), 213–245 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. Truss J.K.: The automorphism group of the random graph: four conjugates good, three conjugates better. Discrete Math 268(1–3), 257–271 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Graduate Center of the City University of New York, 365 Fifth Avenue, New York, NY, 10016, USA

    Samuel Coskey

  2. Department of Mathematics, University of Connecticut, 196 Auditorium Road Unit 3009, Storrs, CT, 06269, USA

    Paul Ellis

  3. Department of Mathematics and Computer Science, Wesleyan University, Science Tower 655, 265 Church St., Middletown, CT, 06459, USA

    Scott Schneider

Authors
  1. Samuel Coskey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Ellis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Scott Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Samuel Coskey.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Coskey, S., Ellis, P. & Schneider, S. The conjugacy problem for the automorphism group of the random graph. Arch. Math. Logic 50, 215–221 (2011). https://doi.org/10.1007/s00153-010-0210-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-010-0210-y

Keywords

Mathematics Subject Classification (2000)

Search

Navigation