Papers
Topics
Authors
Recent
Search
2000 character limit reached

Systems of sets of lengths of Puiseux monoids

Published 19 Nov 2017 in math.AC | (1711.06961v1)

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 $\mathbb{Q}{\ge 0}$). We begin by presenting a BF-monoid $M$ with full system of sets of lengths, which means that for each subset $S$ of $\mathbb{Z}{\ge 2}$ there exists an element $x \in M$ whose set of lengths $\mathsf{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 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 = \langle 1/p \mid p \ \text{is prime} \rangle$ with the Goldbach's conjecture; in particular, we show that $\mathsf{L}(2)$ is precisely the set of Goldbach's numbers.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.