SearcharxivSearch

arXiv · 1903.07100

A new approach to a network of congruences on an inverse semigroup

Abstract

This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing the operators lower $k$ and lower $t$. Two series of inverse semigroups, namely $\ker{\alpha_n}$-is-Clifford semigroups and $\beta_n$-is-over-$E$-unitary semigroups, are investigated. Two congruences, namely $\alpha_{n+2}$ and $\beta_{n+2}$, are found to be the least $\ker{\alpha_n}$-is-Clifford and least $\beta_n$-is-over-$E$-unitary congruences on $S$, respectively. A new system of implications is established for the quasivarieties of inverse semigroups induced by the min network.

Explore related subjects

Keep this discovery

BibTeXRIS

Ying-Ying Feng, Li-Min Wang, Lu Zhang, Hai-Yuan Huang. 2019-03-17. A new approach to a network of congruences on an inverse semigroup. https://doi.org/10.1007/s00233-019-09993-0

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