SearcharxivSearch

arXiv · 1706.08832

Structure and a duality of binary operations on monoids and groups

Abstract

In this paper we introduce novel views of monoids and groups. More specifically, for a given set $S$, let $S^{S\times S}$ be the set of binary operations on $S$. We equip $S^{S\times S}$ with canonical binary operations induced by the elements of $S$. Let $S^{S\times S}_{mn}$ (respectively, $S^{S\times S}_{gr}$) be the set of binary operations that make $S$ monoids (respectively, groups). Then we have the following "duality": for each $z\in S^{S\times S}_{mn}$ a certain subset of $S^{S\times S}$, denoted by $S^*_z$, is a monoid with a canonical binary operation and is isomorphic to $(S,z)$. If $z\in S^{S\times S}_{gr}$, then $S^{S\times S}_{gr}$ can be partitioned into copies of $S^*_z$. We also give a new characterization of group binary operations which distinguishes them from the other binary operations. These results give us new insights into monoids and groups, and will provide new tools and directions in studying these objects.

Explore related subjects

Keep this discovery

BibTeXRIS

Masayoshi Kaneda. 2017-06-27. Structure and a duality of binary operations on monoids and groups. https://arxiv.org/abs/1706.08832

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