The conjugacy problem for automorphism groups of homogeneous digraphs

MaRDI QIDQ4598350zbMATH OpenFDO

Authors Samuel Coskey, Paul Ellis

Publication date 20 December 2017

Full work available at URL https://arxiv.org/abs/1509.04222

zbMATH Keywords

Borel complexityconjugacy homogeneous structure

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Descriptive set theory (03E15) Directed graphs (digraphs), tournaments (05C20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous articles. In this article we complete the program, and establish a dichotomy theorem that this complexity is either the minimum or the maximum among relations which are classifiable by countable structures. We also discuss the possibility of extending our results beyond graphs to more general classes of countable homogeneous structures.

Recommendations

• Conjugacy for homogeneous ordered graphs
• On the classification of automorphisms of trees
• On the classification of vertex-transitive structures
• scientific article; zbMATH DE number 887760

Cited in

(4)

• Conjugacy for homogeneous ordered graphs
• Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
• CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES
• Simplicity of some automorphism groups.

This page was built for publication: The conjugacy problem for automorphism groups of homogeneous digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598350)