SearcharxivSearch

arXiv · 2212.01604

Polyboundedness of zero-closed semigroups

Abstract

The polyboundedness number $\mathrm{cov}(\mathcal A_X)$ of a semigroup $X$ is the smallest cardinality of a cover of $X$ by sets of the form $\{x\in X:a_0xa_1\cdots xa_n=b\}$ for some $n\ge 1$, $b\in X$ and $a_0,\dots,a_n\in X^1=X\cup\{1\}$. Semigroups with finite polyboundedness number are called polybounded. A semigroup $X$ is called zero-closed if $X$ is closed in its $0$-extension $X^0=\{0\}\cup X$ endowed with any Hausdorff semigroup topology. We prove that any zero-closed infinite semigroup $X$ has $\mathrm{cov}(\mathcal A_X)<|X|$. Under Martin's Axiom, a zero-closed semigroup is polybounded if $X$ admits a compact Hausdorff semigroup topology or $X$ has a separable complete subinvariant metric.

Explore related subjects

Keep this discovery

BibTeXRIS

Taras Banakh, Andriy Rega. 2022-12-03. Polyboundedness of zero-closed semigroups. https://arxiv.org/abs/2212.01604

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