The dichotomy conjecture for conjugacy problems of automorphism groups
Let be a countable model of an -categorical theory, let be its automorphism group, and let be the conjugacy equivalence relation on , defined by
Conjugacy-complexity dichotomy conjecture. If is the countable model in an -categorical theory, then is either smooth or Borel complete.
This conjecture asks which Borel complexities can occur for conjugacy relations of automorphism groups of countable models of -categorical theories. The paper establishes Borel completeness for the conjugacy problem of the random graph, while noting smooth examples such as the automorphism group of a countable set and that of the complete binary tree; the general dichotomy remains open in the supplied text.
References
- Samuel Coskey, Paul Ellis and Scott Schneider, “The conjugacy problem for the automorphism group of the random graph”, arXiv:0902.4038 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.