SearcharxivSearch

arXiv · 2507.04486

Twisted products of monoids

Abstract

A twisting of a monoid $S$ is a map $\Phi:S\times S\to\mathbb{N}$ satisfying the identity $\Phi(a,b) + \Phi(ab,c) = \Phi(a,bc) + \Phi(b,c)$. Together with an additive commutative monoid $M$, and a fixed $q\in M$, this gives rise a so-called twisted product $M\times_\Phi^qS$, which has underlying set $M\times S$ and multiplication $(i,a)(j,b) = (i+j+\Phi(a,b)q,ab)$. This construction has appeared in the special cases where $M$ is $\mathbb{N}$ or $\mathbb{Z}$ under addition, $S$ is a diagram monoid (e.g.~partition, Brauer or Temperley-Lieb), and $\Phi$ counts floating components in concatenated diagrams. In this paper we identify a special kind of `tight' twisting, and give a thorough structural description of the resulting twisted products. This involves characterising Green's relations, (von Neumann) regular elements, idempotents, biordered sets, maximal subgroups, Sch\"{u}tzenberger groups, and more. We also consider a number of examples, including several apparently new ones, which take as their starting point certain generalisations of Sylvester's rank inequality from linear algebra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James East, Robert D. Gray, P. A. Azeef Muhammed, Nik Ruškuc. 2025-07-06. Twisted products of monoids. https://arxiv.org/abs/2507.04486

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