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 non-cancellative setting, in the same spirit of Baeth and Smertnig's work on the factorization theory of non-commutative, but cancellative monoids (Baeth and Smertnig (2015) [5]). Then, we bring in power monoids and, applying the abstract machinery developed in the first part, we undertake the study of their arithmetic.More in particular, let H be a multiplicatively written monoid. The set Pfin(H) of all non-empty finite subsets of H is naturally made into a monoid, which we call the power monoid of H and is non-cancellative unless H is trivial, by endowing it with the operation (X,Y)↦{xy:(x,y)∈X×Y}.Power monoids are, in disguise, one of the primary objects of interest in arithmetic combinatorics, and here for the first time we tackle them from the perspective of factorization theory. Proofs lead to consider various properties of finite subsets of N that can or cannot be split into a sumset in a non-trivial way, giving rise to a rich interplay with additive number theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.