A characterization of finite abelian groups via sets of lengths in transfer Krull monoids

@article{Zhong2018ACO,
  title={A characterization of finite abelian groups via sets of lengths in transfer Krull monoids},
  author={Qinghai Zhong},
  journal={Communications in Algebra},
  year={2018},
  volume={46},
  pages={4021 - 4041}
}
  • Qinghai Zhong
  • Published 15 November 2017
  • Mathematics, Medicine
  • Communications in Algebra
ABSTRACT Let H be a transfer Krull monoid over a finite abelian group G (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit a∈H can be written as a product of irreducible elements, say , and the number of factors k is called the length of the factorization. The set L(a) of all possible factorization lengths is the set of lengths of a. It is classical that the system ℒ(H) = {L(a)∣a∈H} of all sets of… 

Topics from this paper

On the algebraic and arithmetic structure of the monoid of product-one sequences II
  • J. Oh
  • Computer Science, Mathematics
    Period. Math. Hung.
  • 2019
TLDR
The present paper shows that the class semigroup is Clifford (i.e., a union of groups) if and only if $$|G'| \le 2$$|G′|≤2 if andonly if $${\mathcal {B}} (G)$$B(G) is seminormal.
A characterization of Krull monoids for which sets of lengths are (almost) arithmetical progressions
Let H be a Krull monoid with finite class group G and suppose that every class contains a prime divisor. Then sets of lengths in H have a well-defined structure which just depends on the class group
Factorization theory in commutative monoids
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids
On the Incomparability of Systems of Sets of Lengths
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
Which sets are sets of lengths in all numerical monoids?
We explicitly determine those sets of nonnegative integers which occur as sets of lengths in all numerical monoids.

References

SHOWING 1-10 OF 64 REFERENCES
Factorizations in Bounded Hereditary Noetherian Prime Rings
  • Daniel Smertnig
  • Mathematics
    Proceedings of the Edinburgh Mathematical Society
  • 2018
Abstract If H is a monoid and a = u1 ··· uk ∈ H with atoms (irreducible elements) u1, … , uk, then k is a length of a, the set of lengths of a is denoted by Ⅼ(a), and ℒ(H) = {Ⅼ(a) | a ∈ H} is the
Sets of lengths in maximal orders in central simple algebras
TLDR
It is proved that in a large majority of cases there exists a transfer homomorphism to a monoid of zero-sum sequences over a ray class group of O, which implies that all the structural finiteness results for sets of lengths hold also true for R.
Products of two atoms in Krull monoids and arithmetical characterizations of class groups
TLDR
It is shown that the arithmetical factorization properties encoded in the sets of lengths of a rank 2 prime power order group uniquely characterizes the group.
Cross number invariants of finite abelian groups
Abstract We study the conjectured values of the maximal cross number k ( G ) of a zero-sum free sequence over a finite abelian group G, defined by Krause, and the maximal cross number K 1 ( G ) of a
SYSTEMS OF SETS OF LENGTHS: TRANSFER KRULL MONOIDS VERSUS WEAKLY KRULL MONOIDS
Transfer Krull monoids are monoids which allow a weak transfer homomorphism to a commutative Krull monoid, and hence the system of sets of lengths of a transfer Krull monoid coincides with that of
Sets of minimal distances and characterizations of class groups of Krull monoids
Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. Then every non-unit $$a \in H$$a∈H can be written as a finite product of atoms, say $$a=u_1 \cdot
Power monoids: A bridge between factorization theory and arithmetic combinatorics
Abstract We extend a few fundamental aspects of the classical theory of non-unique factorization, as presented in Geroldinger and Halter-Koch's 2006 monograph on the subject, to a non-commutative and
Sets of Lengths
TLDR
A friendly introduction, which is largely self-contained, to what is known about systems of sets of lengths for rings of integers of algebraic number fields and for transfer Krull monoids of finite type as their generalization is provided.
On congruence half-factorial Krull monoids with cyclic class group
We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values
A characterization of class groups via sets of lengths
Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1
...
1
2
3
4
5
...