Systems of sets of lengths of Puiseux monoids
Abstract
In this paper we study the system of sets of lengths of non-finitely generated atomic Puiseux monoids (a Puiseux monoid is an additive submonoid of Q 0). We begin by presenting a BF-monoid M with full system of sets of lengths, which means that for each subset S of Z 2 there exists an element x ∈ M whose set of lengths L(x) is S. It is well known that systems of sets of lengths do not characterize numerical monoids. Here, we prove that systems of sets of lengths do not characterize non-finitely generated atomic Puiseux monoids. In a recent paper, Geroldinger and Schmid found the intersection of systems of sets of lengths of numerical monoids. Motivated by this, we extend their result to the setting of atomic Puiseux monoids. Finally, we relate the sets of lengths of the Puiseux monoid P = 1/p p \ is prime with the Goldbach's conjecture; in particular, we show that L(2) is precisely the set of Goldbach's numbers.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.