Conjugacy for homogeneous ordered graphs
From MaRDI portal
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Descriptive set theory (03E15) Graph theory (05C99) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Model theory of denumerable and separable structures (03C15)
Abstract: We show that for any countable homogeneous ordered graph , the conjugacy problem for automorphisms of is Borel complete. In fact we establish that each such satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of is Borel reducible to the conjugacy relation on automorphisms of .
Recommendations
- The conjugacy problem for automorphism groups of homogeneous digraphs
- Elements of finite order in automorphism groups of homogeneous structures.
- Homogeneous ordered graphs, metrically homogeneous graphs, and beyond. Volume 1. Ordered graphs and distanced graphs
- Ordered structures and large conjugacy classes
Cites work
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1522814 (Why is no real title available?)
- A survey of homogeneous structures
- Homogeneous ordered graphs, metrically homogeneous graphs, and beyond. Volume 1. Ordered graphs and distanced graphs
- Invariant descriptive set theory
- Katětov functors
- The conjugacy problem for automorphism groups of homogeneous digraphs
- The conjugacy problem for the automorphism group of the random graph
Cited in
(3)
This page was built for publication: Conjugacy for homogeneous ordered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734273)