SearcharxivSearch

arXiv · 2605.26906

Polish topologies on endomorphism monoids of linear orders

Abstract

In this paper, we investigate Polish semigroup topologies on the endomorphism monoids $\operatorname{End}(\mathbb{N},\leq)$ and $\operatorname{End}(\mathbb{Z},\leq)$. We introduce a new structural condition, property $\mathbb{XX}$, which yields automatic continuity of Borel measurable homomorphisms between certain topological semigroups. This provides a new method for analyzing Polish semigroup topologies on monoids with small groups of units. We show that for all monoids considered, the semigroup Zariski topology coincides with the pointwise topology and is therefore the coarsest Hausdorff semigroup topology. We prove that the submonoid $\operatorname{End}^{\infty}(\mathbb{N},\leq)$ of $\operatorname{End}(\mathbb{N},\leq)$ consisting of all endomorphisms with infinite image admits a unique Polish semigroup topology, namely the pointwise topology. On the other hand, despite possessing a finest Polish semigroup topology, the monoids $\operatorname{End}(\mathbb{N},\leq)$ and $\operatorname{End}(\mathbb{Z},\leq)$, admit infinitely many distinct Polish semigroup topologies. Also, we show that the monoid $\operatorname{End}(\mathbb{N},<)$ admits exactly $2^{\aleph_0}$ Polish semigroup topologies and no maximal second-countable semigroup topology.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Serhii Bardyla, Luna Elliott. 2026-05-26. Polish topologies on endomorphism monoids of linear orders. https://arxiv.org/abs/2605.26906

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR