On permutation numerical semigroups
Simone Ugolini

TL;DR
This paper introduces the concept of n-permutation numerical semigroups, constructs multiple families for n=3 and n>2, and provides experimental data supporting a classification conjecture.
Contribution
It defines n-permutation numerical semigroups and constructs numerous examples, expanding understanding of their structure and classification.
Findings
Only three 2-permutation numerical semigroups exist.
Infinitely many n-permutation numerical semigroups for n > 2.
Experimental data supports a conjecture on classifying 3-permutation numerical semigroups.
Abstract
In this paper we introduce the notion of -permutation numerical semigroup. While there are just three -permutation numerical semigroups, there are infinitely many -permutation numerical semigroups if . We construct families of -permutation numerical semigroups and one family of -permutation numerical semigroups. Finally we present some experimental data, which seem to support a conjecture about the classification of -permutation numerical semigroups.
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
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Graph theory and applications
