SearcharxivSearch

arXiv · 2607.19163

Howson property and finitely generated intersection problem for monogenic inverse semigroups

Abstract

An algebraic structure is said to have the Howson property if the intersection of any two finitely generated subalgebras is finitely generated. We explore the Howson property in the context of monogenic inverse semigroups. It is known, due to work of Jones and Trotter (1989) and Jones (2016), that every monogenic inverse semigroup has the Howson property considered as an inverse semigroup, i.e. with respect to its inverse subsemigroups. In this paper, we consider monogenic inverse semigroups qua semigroups, i.e. we consider all their subsemigroups. We prove that every monogenic inverse semigroup possesses the Howson property in this broader sense, with the sole exception of the monogenic free inverse semigroup. For this exceptional case, we show that the problem of determining whether the intersection of two finitely generated subsemigroups is finitely generated is algorithmically decidable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jung Won Cho, Craig Miller, Nik Ruškuc. 2026-07-21. Howson property and finitely generated intersection problem for monogenic inverse semigroups. https://arxiv.org/abs/2607.19163

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