Skip to main content
SpringerLink
Log in

Conjugacy for homogeneous ordered graphs

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

Abstract

We show that for any countable homogeneous ordered graph G, the conjugacy problem for automorphisms of G is Borel complete. In fact we establish that each such G satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of G is Borel reducible to the conjugacy relation on automorphisms of G.

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. Coskey, S., Ellis, P.: The conjugacy problem for automorphism groups of countable homogeneous structures. MLQ Math. Log. Q. 62(6), 580–589 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Coskey, S., Ellis, P.: The conjugacy problem for automorphism groups of homogeneous digraphs. Contrib. Discret. Math. 12(1), 62–73 (2017)

    MathSciNet  MATH  Google Scholar 

  3. Coskey, S., Ellis, P., Schneider, S.: The conjugacy problem for the automorphism group of the random graph. Arch. Math. Logic 50(1–2), 215–221 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cherlin, G.: Homogeneous ordered graphs and metrically homogeneous graphs. preprint, (2018)

  5. Foreman, M.: A descriptive view of ergodic theory. In: Descriptive set theory and dynamical systems (Marseille-Luminy, 1996), of London Math. Soc. Lecture Note Ser., vol. 277, pp. 87–171. Cambridge University Press, Cambridge (2000)

  6. Gao, S.: Invariant Descriptive Set Theory. Pure and Applied Mathematics (Boca Raton), vol. 293. CRC Press, Boca Raton (2009)

    MATH  Google Scholar 

  7. Hodges, W.: Model Theory. Encyclopedia of Mathematics and its Applications, vol. 42. Cambridge University Press, Cambridge (1993)

    Book  MATH  Google Scholar 

  8. Kubiś, W., Mašulović, D.: Katětov functors. Appl. Categor. Struct. 25(4), 569–602 (2017). https://doi.org/10.1007/s10485-016-9461-z

    Article  MATH  Google Scholar 

  9. Macpherson, D.: A survey of homogeneous structures. Discret. Math. 311(15), 1599–1634 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Boise State University, 1910 University Drive, Boise, ID, 83725, USA

    Samuel Coskey

  2. Department of Mathematics and Computer Science, Manhattanville College, 2900 Purchase Street, Purchase, NY, 10577, USA

    Paul Ellis

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

Corresponding author

Correspondence to Paul Ellis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Coskey, S., Ellis, P. Conjugacy for homogeneous ordered graphs. Arch. Math. Logic 58, 457–467 (2019). https://doi.org/10.1007/s00153-018-0645-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-018-0645-0

Keywords

Mathematics Subject Classification

Search

Navigation