m-irreducible numerical semigroups
V. Blanco, J.C. Rosales
TL;DR
This paper introduces m-irreducibility, extending the concept of irreducibility for numerical semigroups with fixed multiplicity, and provides algorithms for their decomposition.
Contribution
It defines m-irreducibility, analyzes their structure, and develops algorithms for decomposing numerical semigroups into m-irreducible components.
Findings
Characterization of m-irreducible numerical semigroups
Structural properties of m-irreducible sets
Algorithms for decomposition into m-irreducible semigroups
Abstract
In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical semigroups, we give some properties of these numerical semigroups and we present algorithms to compute the decomposition of a numerical semigroups with multiplicity m into m-irreducible 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 · Scheduling and Timetabling Solutions