SearcharxivSearch

arXiv · 2302.08988

Topological embeddings into transformation monoids

Abstract

In this paper we consider the questions of which topological semigroups embed topologically into the full transformation monoid $\mathbb{N} ^ \mathbb{N}$ or the symmetric inverse monoid $I_{\mathbb{N}}$ with their respective canonical Polish semigroup topologies. We characterise those topological semigroups that embed topologically into $\mathbb{N} ^ \mathbb{N}$ and belong to any of the following classes: commutative semigroups; compact semigroups; groups; and certain Clifford semigroups. We prove analogous characterisations for topological inverse semigroups and $I_{\mathbb{N}}$. We construct several examples of countable Polish topological semigroups that do not embed into $\mathbb{N} ^ \mathbb{N}$, which answer, in the negative, a recent open problem of Elliott et al. Additionally, we obtain two sufficient conditions for a topological Clifford semigroup to be metrizable, and prove that inversion is automatically continuous in every Clifford subsemigroup of $\mathbb{N}^\mathbb{N}$. The former complements recent works of Banakh et al.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Bardyla, L. Elliott, J. D. Mitchell, Y. Peresse. 2023-02-17. Topological embeddings into transformation monoids. https://doi.org/10.1515/forum-2023-0230

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