On sets related to integer partitions with quasi-required elements and disallowed elements
| Autor: | Robles-Pérez, Aureliano M., Rosales, José Carlos |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Aequationes Math. 98(2) (2024), 423-440 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1007/s00010-023-01005-5 |
| Popis: | 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. Comment: 17 pages; typos corrected |
| Databáze: | arXiv |
| Externí odkaz: |
|