Samuel Coskey, Paul Ellis, Scott Schneider
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.
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.
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$.
In order to understand the structure of the "typical" element of an automorphism group, one has to study how large the conjugacy classes of the group are. For the case when typical is meant in the sense of Baire category, Truss proved that there is a co-meagre conjugacy class in Aut(Q, <), the automorphism group of the rational numbers. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. We give a complete description of the size of the conjugacy classes of Aut(Q, <) with respect to this notion. In particula…
This article is a contribution to the following problem: does there exist a Polish non-archimedean group (equivalently: automorphism group of a Fraisse limit) that is extremely amenable, and has ample generics. As Fraisse limits whose automorphism groups are extremely amenable must be ordered, i.e., equipped with a linear ordering, we focus on ordered Fraisse limits. We prove that automorphism groups of the universal ordered boron tree, and the universal ordered poset have a comeager conjugacy class but no comeager $2$-dimensional diagonal conjugacy class. We also provide general conditions im…
We give a complete description of the size of the conjugacy classes of the automorphism group of the random graph with respect to Christensen's Haar null ideal. It is shown that every non-Haar null class contains a translated copy of a nonempty portion of every compact set and that there are continuum many non-Haar null conjugacy classes. Our methods also yield a new proof of an old result of Truss.
We prove that the automorphism group of the Urysohn diversity is a universal Polish group. Furthermore we show that the automorphism group of the rational Urysohn diversity has ample generics, a dense conjugacy class and that it embeds densely into the automorphism group of the (full) Urysohn diversity. It follows that this latter group also has a dense conjugacy class.
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the conjugacy problem in the case of automorphisms of several non-regularly branching trees.
Many non-locally compact second countable groups admit a comeagre conjugacy class. For example, this is the case for the automorphism group of the rational order and the automorphism group of the random graph [Truss]. A. Kechris and C. Rosendal ask if a non-trivial locally compact second countable group can admit a comeagre conjugacy class. We answer the question in the negative via an analysis of locally compact second countable groups with topological conditions on a conjugacy class.
We study topological properties of conjugacy classes in Polish groups, with emphasis on automorphism groups of homogeneous countable structures. We first consider the existence of dense conjugacy classes (the topological Rokhlin property). We then characterize when an automorphism group admits a comeager conjugacy class (answering a question of Truss) and apply this to show that the homeomorphism group of the Cantor space has a comeager conjugacy class (answering a question of Akin-Hurley-Kennedy). Finally, we study Polish groups that admit comeager conjugacy classes in any dimension (in which…
In order to understand the structure of the `typical' element of an automorphism group, one has to study how large the conjugacy classes of the group are. When typical is meant in the sense of Baire category, a complete description of the size of the conjugacy classes has been given by Kechris and Rosendal. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. When typical means random, that is, almost every with respect to this notion of Haar null sets, the behavior of the automorphisms is entirely different …
Automorphism groups of measures on the Cantor space. Part I: Good measures and Rokhlin properties
本文研究 Cantor 空间上测度自同构群中存在稠密或余瘦共轭类的判据，利用 Fraïssé 理论将好测度刻画为超齐次测度的子类，并确定了取有理值且自同构群承认余瘦共轭类的好测度。
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated groups with undecidable conjugacy problems, whose descriptions arguably do not involve any type of computation. For many automorphism groups of subshifts, as well as the group of asynchronous transducers and the homeomorphism group of the Cantor set, our result implies the existence of two elements such that every finitely-generated subgroup containing both ha…
We show that the automorphism group of Philip Hall's universal locally finite group has ample generics,that is, it admits comeager diagonal conjugacy classes in all dimensions.Consequently, it has the small index property, is not the union of a countable chain of non-open subgroups, and has the automatic continuity property. Also, we discuss some algebraic and topological properties of the automorphism group of Hall universal group. For example, we show that every generic automorphism of Hall universal group is conjugate to all of its powers, and hence has roots of all orders.
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group of an $ω$-categorical structure can go down to reducts. Together, those results prove that a large number of $ω$-categorical structures that appear in the literature have an automorphism group of finite topological rank. In fact, we are not aware of any $ω$-categorical structure to which they do not apply (assuming the automorphism group has no compact quotie…
The automorphism group of the random poset does not admit a generic pair
该研究针对Truss提出的问题，证明随机偏序集的每一对自同构的共轭类都是贫集，同时说明当前定理2的证明存在缺漏，研究仍在推进中。
Generics in invariant subsets of some highly homogeneous permutation groups
本文证明不涉及循环序的闭高度齐次置换群中，共轭类闭包含余稠密共轭类，且有限部分映射族具共尾合并性质，并推广至典型超齐次偏序自同构。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。