Search arXivSearch

arXiv · 1908.00791

Automorphism groups of superextensions of finite monogenic semigroups

Abstract

A family $\mathcal L$ of subsets of a set $X$ is called linked if $A\cap B\ne\emptyset$ for any $A,B\in\mathcal L$. A linked family $\mathcal M$ of subsets of $X$ is maximal linked if $\mathcal M$ coincides with each linked family $\mathcal L$ on $X$ that contains $\mathcal M$. The superextension $\lambda(X)$ of $X$ consists of all maximal linked families on $X$. Any associative binary operation $* : X\times X \to X$ can be extended to an associative binary operation $*: \lambda(X)\times\lambda(X)\to\lambda(X)$. In the paper we study automorphisms of the superextensions of finite monogenic semigroups and characteristic ideals in such semigroups. In particular, we describe the automorphism groups of the superextensions of finite monogenic semigroups of cardinality $\leq 5$.

Explore related subjects

Keep this discovery

BibTeXRIS

Taras Banakh, Volodymyr Gavrylkiv. 2019-08-02. Automorphism groups of superextensions of finite monogenic semigroups. https://arxiv.org/abs/1908.00791

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