论文标题
在与带有准元素的整数分区相关的集合上，不允许元素
On sets related to integer partitions with quasi-required elements and disallowed elements
论文作者
论文摘要
给定一组非负整数和一组积极整数的B集，我们有兴趣计算所有集合中的所有集合C（积极整数的）c（积极整数）的群体（i）K（i）k的一组k（i）k（i）k（i）k（i）k（i）k（i）k（i）至少包含一个属于A和II元素的元素组合所产生的元素。解决这个问题，我们将其转化为数值半群问题。
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.
