Abstract

Half-factoriality is a central concept in the theory of non-unique factorization, with applications for instance in algebraic number theory. A subsetG 0 of an abelian group is called half-factorial if the block monoid overG 0, which is the monoid of all zero-sum sequences of elements ofG 0, is a half-factorial monoid. In this paper we study half-factorial sets with large cardinality in elementaryp-groups. First, we determine the maximal cardinality of such half-factorial sets, and generalize a result which has been only known for groups of even rank. Second, we characterize the structure of all half-factorial sets with large cardinality (in a sense made precise in the paper). Both results have a direct application in the study of some counting functions related to factorization properties of algebraic integers.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call