Products of two atoms in Krull monoids and arithmetical characterizations of class groups.
Clicks: 172
ID: 45988
2013
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
2.4
/100
8 views
8 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
Let [Formula: see text] be a Krull monoid with finite class group [Formula: see text] such that every class contains a prime divisor and let [Formula: see text] be the Davenport constant of [Formula: see text]. Then a product of two atoms of [Formula: see text] can be written as a product of at most [Formula: see text] atoms. We study this extremal case and consider the set [Formula: see text] defined as the set of all [Formula: see text] with the following property: there are two atoms [Formula: see text] such that [Formula: see text] can be written as a product of [Formula: see text] atoms as well as a product of [Formula: see text] atoms. If [Formula: see text] is cyclic, then [Formula: see text]. If [Formula: see text] has rank two, then we show that (apart from some exceptional cases) [Formula: see text]. This result is based on the recent characterization of all minimal zero-sum sequences of maximal length over groups of rank two. As a consequence, we are able to show that the arithmetical factorization properties encoded in the sets of lengths of a rank [Formula: see text] prime power order group uniquely characterizes the group.
| Reference Key |
baginski2013productseuropean
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Baginski, Paul;Geroldinger, Alfred;Grynkiewicz, David J;Philipp, Andreas; |
| Journal | european journal of combinatorics = journal europeen de combinatoire = europaische zeitschrift fur kombinatorik |
| Year | 2013 |
| DOI |
DOI not found
|
| URL | URL not found |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.