On the incomparability of systems of sets of lengths

DOI10.1016/J.EJC.2023.103694MaRDI QIDQ6116409zbMATH OpenFDO

Authors Alfred Geroldinger, Wolfgang A. Schmid

Publication date 18 July 2023

Published in European Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2005.03316

zbMATH Keywords

class groupdivisor homomorphismsdomainsKrull monoidmonoidssets of lengths

Mathematics Subject Classification ID

Computational number theory (11Y99) Divisibility and factorizations in commutative rings (13A05) Class groups (13C20) Dedekind, Prüfer, Krull and Mori rings and their generalizations (13F05) Arithmetic theory of semigroups (20M13) Commutative semigroups (20M14)

Abstract: Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. We consider the system $mathcalL(H)$ of all sets of lengths of $H$ and study when $mathcalL(H)$ contains or is contained in a system $mathcalL(H^{\prime })$ of a Krull monoid $H^{\prime }$ with finite class group $G^{\prime }$, prime divisors in all classes and Davenport constant $mathsfD(G^{\prime })=mathsfD(G)$. Among others, we show that if $G$ is either cyclic of order $mge7$ or an elementary $2$-group of rank $m-1ge6$, and $G^{\prime }$ is any group which is non-isomorphic to $G$ but with Davenport constant $mathsfD(G^{\prime })=mathsfD(G)$, then the systems $mathcalL(H)$ and $mathcalL(H^{\prime })$ are incomparable.

Review text

All monoids considered in the paper are commutative and cancellative. A monoid homomorphism \(\varphi : H\to G\) is called a divisor homomorphism, if for all \( a, b \in H\) \( \varphi (a)| \varphi (b)\) implies that \(a | b \). A monoid \(H\) is called a Krull monoid if it admits a divisor homomorphism into a free abelian monoid. Below the abstract to the paper is quoted. ``Let \(H\) be a Krull monoid with finite class group \(G\) such that every class contains a prime divisor. We consider the system \(\mathcal{L}(H) \) of all sets of lengths of \( H\) and study when \(\mathcal{L}(H) \) contains or is contained in a system \(\mathcal{L}(H ') \) of a Krull monoid \(H'\) with finite class group \(G'\), prime divisors in all classes and Davenport constant \(\mathrm {D}(G') = \mathrm {D}(G)\). Among others, we show that if \(G\) is either cyclic of order \( m \geq 7\) or an elementary 2-group of rank \(m-1 \geq 6\), and \(G'\) is any group which is non-isomorphic to \(G\) but with Davenport constant \(\mathrm {D}(G') = \mathrm {D}(G)\), then the systems \(\mathcal{L}(H) \) and \(\mathcal{L}(H ') \) are incomparable.

Recommendations

• Characterization of class groups of Krull monoids via their systems of sets of lengths: a status report.
• A characterization of class groups via sets of lengths
• The system of sets of lengths in Krull monoids under set addition
• A characterization of class groups via sets of lengths. II.
• Arithmetical characterization of class groups of the form \(\mathbb Z/n\mathbb Z\oplus\mathbb Z/n\mathbb Z\) via the system of sets of lengths.

Cites work

• A characterization of class groups via sets of lengths
• A characterization of class groups via sets of lengths. II.
• A characterization of finite abelian groups via sets of lengths in transfer Krull monoids
• A characterization of Krull monoids for which sets of lengths are (almost) arithmetical progressions
• An asymptotically tight bound for the Davenport constant
• Arithmetical characterization of class groups of the form \(\mathbb Z/n\mathbb Z\oplus\mathbb Z/n\mathbb Z\) via the system of sets of lengths.
• Characterization of class groups of Krull monoids via their systems of sets of lengths: a status report.
• Combinatorial number theory and additive group theory. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse)
• Factorization theory in commutative monoids
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• On the lower bounds of Davenport constant
• On the order of elements in long minimal zero-sum sequences
• Power monoids: a bridge between factorization theory and arithmetic combinatorics
• Products of two atoms in Krull monoids and arithmetical characterizations of class groups.
• Sets of lengths
• Sets of lengths in maximal orders in central simple algebras.
• Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
• Sets of minimal distances and characterizations of class groups of Krull monoids
• Some Recent Results and Open Problems on Sets of Lengths of Krull Monoids with Finite Class Group
• Structural properties of subadditive families with applications to factorization theory
• Systems of sets of lengths of Puiseux monoids
• Systems of sets of lengths: transfer Krull monoids versus weakly Krull monoids
• The catenary degree of Krull monoids. I
• The catenary degree of Krull monoids. II.
• The set of minimal distances in Krull monoids

Cited in

(2)

• Systems of sets of lengths.
• Systems of sets of lengths. II

This page was built for publication: On the incomparability of systems of sets of lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116409)