arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.11577math.GRmath.GN
收藏

在关系结构的内射单形上波兰拓扑

Polish topologies on endomorphism monoids of relational structures

University of St Andrews(圣安德鲁斯大学);Austrian Science Fund (FWF)(奥地利科学基金);Czech Science Foundation(捷克科学基金会)

L. Elliott, J. Jonušas, J. D. Mitchell, Y. Péresse, M. Pinsker

AI总结:

本文提出了一种方法,用于刻画可数关系结构A的内射单形End(A)的最小和最大半群拓扑。结果显示,随机图、随机有向图和随机偏序等结构的内射单形具有唯一的波兰半群拓扑,即由Baire空间N^N的通常拓扑诱导的子空间拓扑。

摘要:

本文介绍了用于刻画可数关系结构A的内射单形End(A)的最小和最大半群拓扑的一般技术。作为应用,我们证明了包括随机图、随机有向图和随机偏序在内的几种知名关系结构的内射单形具有唯一的波兰半群拓扑。在每种情况下,该唯一拓扑都是由Baire空间N^N的通常拓扑诱导的子空间拓扑。我们还证明了许多这些结构具有以下性质:从其内射单形到第二个可数拓扑半群的每个同态都是连续的;称为自动连续性。许多关于内射单形的结果被扩展到相同的结构上的多态式克隆。

英文摘要:

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show that the endomorphism monoids of several well-known relational structures, including the random graph, the random directed graph, and the random partial order, possess a unique Polish semigroup topology. In every case this unique topology is the subspace topology induced by the usual topology on the Baire space $\mathbb{N} ^ \mathbb{N}$. We also show that many of these structures have the property that every homomorphism from their endomorphism monoid to a second countable topological semigroup is continuous; referred to as automatic continuity. Many of the results about endomorphism monoids are extended to clones of polymorphisms on the same structures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑