The conjugacy problem for the automorphism group of the random graph release_xnvasrl7cnb5lbwgekr3dzgbfu

by Samuel Coskey, Paul Ellis, Scott Schneider

Released as a article .

2009  

Abstract

We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.
In text/plain format

Archived Files and Locations

application/pdf  92.0 kB
file_6napkqhl4rhrdfksk7qsv3lqh4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2009-02-23
Version   v1
Language   en ?
arXiv  0902.4038v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4846c6e7-eed9-40ea-bfc7-8575eb9b22c7
API URL: JSON