SearcharxivSearch

arXiv · 1601.01151

On a semitopological polycyclic monoid

Abstract

We study algebraic structure of the $λ$-polycyclic monoid $P_λ$ and its topologizations. We show that the $λ$-polycyclic monoid for an infinite cardinal $λ\geqslant 2$ has similar algebraic properties so has the polycyclic monoid $P_n$ with finitely many $n\geqslant 2$ generators. In particular we prove that for every infinite cardinal $λ$ the polycyclic monoid $P_λ$ is a congruence-free combinatorial $0$-bisimple $0$-$E$-unitary inverse semigroup. Also we show that every non-zero element $x$ is an isolated point in $(P_λ,τ)$ for every Hausdorff topology $τ$ on $P_λ$, such that $(P_λ,τ)$ is a semitopological semigroup, and every locally compact Hausdorff semigroup topology on $P_λ$ is discrete. The last statement extends results of the paper [33] obtaining for topological inverse graph semigroups. We describe all feebly compact topologies $τ$ on $P_λ$ such that $\left(P_λ,τ\right)$ is a semitopological semigroup and its Bohr compactification as a topological semigroup. We prove that for every cardinal $λ\geqslant 2$ any continuous homomorphism from a topological semigroup $P_λ$ into an arbitrary countably compact topological semigroup is annihilating and there exists no a Hausdorff feebly compact topological semigroup which contains $P_λ$ as a dense subsemigroup.

Explore related subjects

Keep this discovery

BibTeXRIS

Serhii Bardyla, Oleg Gutik. 2016-01-06. On a semitopological polycyclic monoid. https://arxiv.org/abs/1601.01151

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