Search arXivSearch

arXiv · 2603.20628

Criteria for existence of semigroup homomorphisms and projective rank functions

Abstract

Let $P,$ $S,$ and $T$ be semigroups, $f:P\to S$ and $g:P\to T$ semigroup homomorphisms, and $X$ a generating set for $S$ (possibly infinite). Clearly, a necessary condition for there to exist a homomorphism $S\to T$ making a commuting triangle with $f$ and $g$ is that for every relation $f(p) = w(x_1,\,\dots\,,\,x_n)$ holding in $S$, with $p\in P,$ $w$ a semigroup word, and $x_1,\,\dots\,,\,x_n \in X,$ there exist $t_1,\,\dots,\,t_n\in T$ satisfying $g(p) = w(t_1,\,\dots\,,\,t_n).$ Under what assumptions will that also be sufficient? We show that one such family of assumptions is that (i) every element of $S$ is a divisor some element of $f(P),$ (ii) $T$ is right and left cancellative, (iii) $T$ is power-cancellative, i.e, $x^d = y^d \implies x = y$ for $d > 0,$ and (iv) a certain technical condition which, in particular, holds if $T$ admits a semigroup ordering with the order-type of the natural numbers. As an application, we obtain an elementary criterion for the existence of an integer-valued rank function on finitely generated projective modules over a ring.

Explore related subjects

Keep this discovery

BibTeXRIS

George M. Bergman. 2026-03-21. Criteria for existence of semigroup homomorphisms and projective rank functions. https://arxiv.org/abs/2603.20628

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