arXiv · 2203.10376
On sets related to integer partitions with quasi-required elements and disallowed elements
Abstract
Given a set A of non-negative integers and a set B of positive integers,we are interested in computing all sets C (of positive integers) that are minimal in the family of sets K (of positive integers) such that (i) K contains no elements generated by non-negative integer linear combinations of elements in A and (ii) for any partition of an element in B there is at least one summand that belongs to K. To solve this question, we translate it into a numerical semigroups problem.
Explore related subjects
Keep this discovery
Aureliano M. Robles-Pérez, José Carlos Rosales. 2022-03-19. On sets related to integer partitions with quasi-required elements and disallowed elements. https://doi.org/10.1007/s00010-023-01005-5
Cite the original work for its findings. Save a collection to share your selection of sources.