@misc{10481/85366,
year = {2023},
month = {10},
url = {https://hdl.handle.net/10481/85366},
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.},
organization = {Funding for open access publishing: Universidad de Granada/CBUA},
organization = {“Proyecto de Excelencia de la Junta de Andalucía Grant Number ProyExcel 00868”},
organization = {“Junta de Andalucía Grant
Number FQM-343”},
organization = {Funding for open access charge: Universidad de Granada/CBUA},
publisher = {Springer Nature},
keywords = {Integer partition},
keywords = {Numerical semigroup},
keywords = {Irreducible numerical semigroup},
keywords = {Apéry set},
title = {On sets related to integer partitions with quasi-required elements and disallowed elements},
doi = {10.1007/s00010-023-01005-5},
author = {Robles Pérez, Aureliano M. and Rosales González, José Carlos},
}