On the order of magnitude of certain integer sequences
Michael Hellus, Anton Rechenauer, Rolf Waldi

TL;DR
This paper investigates the growth rates of invariants in numerical semigroups generated by primes above a certain threshold, comparing them and providing bounds based on number theory conjectures and evidence.
Contribution
It introduces new comparisons of invariants in prime-generated numerical semigroups and relates them to conjectures in additive number theory.
Findings
The biggest atom $u$ of $S$ is bounded above by approximately $6p$ based on conjectural evidence.
Numerical evidence supports specific bounds on semigroup invariants.
Connections are made between semigroup invariants and prime sum representations.
Abstract
Let be a prime number, and let be the numerical semigroup generated by the prime numbers not less than . We compare the orders of magnitude of some invariants of with each other, e. g., the biggest atom of with itself: By Harald Helfgott (arXiv:1312.7748 [math.NT]), every odd integer greater than five can be written as the sum of three prime numbers. There is numerical evidence suggesting that the summands of always can be chosen between and . This would imply that is less than .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories
