Searcharxiv⌕ Search

arXiv · 2611.21699

The system of length sets of transfer Krull monoids over $C_3 \oplus C_3 \oplus C_3$

Abstract

Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. There are precisely nine groups (up to isomorphism) for which the set of distances of $H$ is contained in $\{1, 2\}$. For all these groups, except for $C_3 \oplus C_3 \oplus C_3$, the system of length sets has been written down explicitly. In this paper we close this gap and determine the system of length sets when the class group is isomorphic to $C_3 \oplus C_3 \oplus C_3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alfred Geroldinger, Benjamin Hackl, Qinghai Zhong. 2026-11-16. The system of length sets of transfer Krull monoids over $C_3 \oplus C_3 \oplus C_3$. https://searcharxiv.com/abs/2611.21699

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗