Abstract
AbstractGiven a setAof non-negative integers and a setBof positive integers, we are interested in computing all setsC(of positive integers) that are minimal in the family of setsK(of positive integers) such that (i)Kcontains no elements generated by non-negative integer linear combinations of elements inAand (ii) for any partition of an element inBthere is at least one summand that belongs toK. To solve this question, we translate it into a numerical semigroups problem.
Funder
Junta de Andalucía
Proyecto de Excelencia de la Junta de Andalucía
Universidad de Granada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,General Mathematics
Reference12 articles.
1. Andrews, G.E.: The Theory of Partitions, Encyclopedia of Mathematics and Its Applications, Vol. 2 (G.-C. Rota, Ed., Addison-Wesley, Reading, 1976. Reprinted: Cambridge Univ. Press, New York, (1998))
2. Andrews, G.E.: Partitions. In: R. Wilson, J. J. Watkins, Eds., Combinatorics: Ancient & Modern (Oxford University Press, Oxford, pp. 205–229) (2013)
3. Apéry, R.: Sur les branches superlinéaires des courbes algébriques. C. R. Acad. Sci. Paris 222, 1198–1200 (1946)
4. Barucci, V., Dobbs, D.E., Fontana, M.: Maximality Properties in Numerical Semigroups and Applications to One-Dimensional Analytically Irreducible Local Domains, Mem. Amer. Math. Soc. 598 (1997)
5. Blanco, V., Rosales, J.C.: On the enumeration of the set of numerical semigroups with fixed Frobenius number. Comput. Math. Appl. 63, 1204–1211 (2012)