SearcharxivSearch

arXiv · 1903.10236

A combinatorial approach to the structure of locally inverse semigroups

Abstract

This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the role that Cayley graphs have for group presentations or that Sch\"utzenberger graphs have for inverse monoid presentations. However, our graphs have considerable differences with the latter two, even though locally inverse semigroups generalize both groups and inverse semigroups. For example, the graphs introduced here are not `inverse word graphs'. Instead, they are bipartite graphs with both oriented and non-oriented edges, and with labels on the oriented edges only. A byproduct of the theory developed here is the introduction of a graphical method for dealing with general locally inverse semigroups. These graphs are able to describe, for a locally inverse semigroup given by a presentation, many of the usual concepts used to study the structure of semigroups, such as the idempotents, the inverses of an element, the Green's relations, and the natural partial order. Finally, the paper ends characterizing the semigroups belonging to some usual subclasses of locally inverse semigroups in terms of properties on these graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Luís Oliveira. 2019-03-25. A combinatorial approach to the structure of locally inverse semigroups. https://doi.org/10.1007/s00233-021-10203-z

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