## Conjugacy for homogeneous ordered graphs. (arXiv:1804.04609v1 [math.LO])

We show that for any countable homogeneous ordered graph \$G\$, the conjugacy problem for automorphisms of \$G\$ is Borel complete. In fact we establish that each such \$G\$ satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of \$G\$ is Borel reducible to the conjugacy relation on automorphisms of \$G\$.查看全文

## Solidot 文章翻译

 你的名字 留空匿名提交 你的Email或网站 用户可以联系你 标题 简单描述 内容 We show that for any countable homogeneous ordered graph \$G\$, the conjugacy problem for automorphisms of \$G\$ is Borel complete. In fact we establish that each such \$G\$ satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of \$G\$ is Borel reducible to the conjugacy relation on automorphisms of \$G\$.