On sets related to integer partitions with quasi-required elements and disallowed elements
From MaRDI portal
Publication:6130583
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.
Recommendations
- A problem of integer partitions and numerical semigroups
- A combinatorial problem and numerical semigroups
- Some partitions of positive integers
- On the set of integer partition and closed form for its length in special cases
- Decision problems for some classes of integer partitions and number multisets
Cites work
- A problem of integer partitions and numerical semigroups
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 3101854 (Why is no real title available?)
- Irreducible numerical semigroups.
- Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
- Numerical semigroups.
- On numerical semigroups
- On the enumeration of the set of numerical semigroups with fixed Frobenius number.
- Partitions
- The tree of irreducible numerical semigroups with fixed Frobenius number
This page was built for publication: On sets related to integer partitions with quasi-required elements and disallowed elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130583)