SearcharxivSearch

arXiv · 1810.05938

Groupoids on a skew lattice of objects

Abstract

Motivated by some alternatives to the classical logical model of boolean algebra, this paper deals with algebraic structures which extend skew lattices by locally invertible elements. Following the meme of the Ehresmann-Schein-Nambooripad theorem, we consider a groupoid (small category of isomorphisms) in which the set of objects carries the structure of a skew lattice. The objects act on the morphisms by left and right restriction and extension mappings of the morphisms, imitating those of an inductive groupoid. Conditions are placed on the actions, from which pseudoproducts may be defined. This gives an algebra of signature (2,2,1), in which each binary operation has the structure of an orthodox semigroup. In the reverse direction, a groupoid of the kind described may be reconstructed from the algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

D. G. FitzGerald. 2018-10-13. Groupoids on a skew lattice of objects. https://arxiv.org/abs/1810.05938

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