Article contents
A problem of integer partitions and numerical semigroups
Published online by Cambridge University Press: 27 December 2018
Abstract
Let C be a set of positive integers. In this paper, we obtain an algorithm for computing all subsets A of positive integers which are minimals with the condition that if x1 + … + xn is a partition of an element in C, then at least a summand of this partition belongs to A. We use techniques of numerical semigroups to solve this problem because it is equivalent to give an algorithm that allows us to compute all the numerical semigroups which are maximals with the condition that has an empty intersection with the set C.
MSC classification
- Type
- Research Article
- Information
- Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 149 , Issue 4 , August 2019 , pp. 969 - 978
- Copyright
- Copyright © Royal Society of Edinburgh 2018
References
- 2
- Cited by