Advertisement

On the classification of vertex-transitive structures

  • John Clemens
  • Samuel Coskey
  • Stephanie Potter
Article
  • 4 Downloads

Abstract

We consider the classification problem for several classes of countable structures which are “vertex-transitive”, meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that the classification of countable vertex-transitive digraphs and partial orders are Borel complete. We identify the complexity of the classification of countable vertex-transitive linear orders. Finally we show that the classification of vertex-transitive countable tournaments is properly above \(E_0\) in complexity.

Keywords

Borel complexity theory Graphs Linear orders Tournaments 

Mathematics Subject Classification

03E15 05C63 05C20 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgements

This work represents a portion of the third author’s master’s thesis [7]. The thesis was completed at Boise State University under the supervision of the second author, with significant input from the first author.

References

  1. 1.
    Clemens, J.D.: Isomorphism of homogeneous structures. Notre Dame J. Form. Log. 50(1), 1–22 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Dougherty, R., Jackson, S., Kechris, A.S.: The structure of hyperfinite Borel equivalence relations. Trans. Am. Math. Soc. 341(1), 193–225 (1994)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Gao, S.: Invariant Descriptive Set Theory. Pure and Applied Mathematics (Boca Raton), vol. 293. CRC Press, Boca Raton (2009)Google Scholar
  4. 4.
    Hamkins, J.D., Lewis, Andy: Infinite time Turing machines. J. Symb. Log. 65(2), 567–604 (2000)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Harrington, L.A., Kechris, A.S., Louveau, A.: A Glimm-Effros dichotomy for Borel equivalence relations. J. Am. Math. Soc. 3(4), 903–928 (1990)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Hjorth, G.: An absoluteness principle for Borel sets. J. Symb. Log. 63(2), 663–693 (1998)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Potter, S.: On the classification of vertex-transitive structures. Master’s thesis, Boise State University, Boise, ID (2017)Google Scholar
  8. 8.
    Rosenstein, J.G.: Linear Orderings, Pure and Applied Mathematics, vol. 98. Academic Press Inc., Harcourt Brace Jovanovich Publishers, New York-London (1982)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Boise State UniversityBoiseUSA

Personalised recommendations