SearcharxivSearch

arXiv · 2510.24092

Classifications of dimonoids with at most three elements

Abstract

In this paper, we present complete classifications, up to isomorphism, of all two-element dimonoids, all commutative three-element dimonoids, and all abelian three-element dimonoids. We show that, up to isomorphism, there exist exactly 8 two-element dimonoids, of which 3 are commutative. Among these, 4 are abelian, and the remaining nonabelian dimonoids form 2 pairs of dual dimonoids. Furthermore, there are exactly 5 pairwise nonisomorphic trivial dimonoids of order 2. For dimonoids of order 3, we prove that there are precisely 14 pairwise nonisomorphic commutative dimonoids, including 12 trivial dimonoids and a single pair of nonabelian nontrivial dual dimonoids. We also establish that, up to isomorphism, there are 17 abelian dimonoids of order 3, consisting of 12 trivial commutative dimonoids and 5 noncommutative nontrivial ones. In addition, we demonstrate the existence of at least 26 pairwise nonisomorphic nonabelian noncommutative dimonoids of order 3. Among them, there are exactly 6 pairs of trivial dual dimonoids and at least 7 pairs of nontrivial dual dimonoids.

Explore related subjects

Keep this discovery

BibTeXRIS

Volodymyr M. Gavrylkiv. 2025-10-28. Classifications of dimonoids with at most three elements. https://arxiv.org/abs/2510.24092

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