Power monoids: A bridge between factorization theory and arithmetic combinatorics
By Yushuang Fan, S. Tringali. Journal of Algebra, 2017
71 citations recorded by the source corpus.
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 P fin ( 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 ) ↦ { x y : ( 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.
Subfields: Algebra and Number Theory, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/da2fcd3fefad12a0f5da7da2fa4fb893c595ce75
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
In Computational Theory and Mathematics
Citations in the corpus
- Arithmetic of commutative semigroups with a focus on semigroups of ideals and modules (2016, background): “It follows from [16] that H(E) is a finitely generated BF-monoid, and hence Theorem 3.”
- On strongly primary monoids, with a focus on Puiseux monoids (2019, background): “The structure of unions of sets of lengths has been studied for a wide range of monoids and domains (see [14, 4, 15, 55] for recent progress).”