SearcharxivSearch

arXiv · 2607.03020

On algebraic and arithmetic properties of monoids of product-$K$ sequences

Abstract

Let $G$ be a group and $K$ be a normal subgroup of $G$. A sequence over $G$ is a finite collection of terms from $G$, where repetition is allowed, and the order is disregarded. A product-$K$ sequence is a sequence whose terms can be ordered such that their product in $G$ belongs to $K$. The set $\mathcal B_K (G)$ of all product-$K$ sequences over $G$ forms a monoid, called the monoid of product-$K$ sequences, under the operation of sequence concatenation. In this paper, we investigate the algebraic and arithmetic properties of the monoid $\mathcal B_K (G)$. Among our main results, we provide precise characterizations of when the monoid $\mathcal B_K (G)$ satisfies key properties, namely being a (transfer) Krull, seminormal, or (half-)factorial. Our results generalize existing frameworks, making them applicable to both the classical abelian and the more recently developed non-abelian settings.

Explore related subjects

Keep this discovery

BibTeXRIS

Jun Seok Oh, Doniyor Yazdonov. 2026-07-03. On algebraic and arithmetic properties of monoids of product-$K$ sequences. https://arxiv.org/abs/2607.03020

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