A computational approach to the study of finite-complement submonids of an affine cone
arXiv:2409.06376
Abstract
Let be an integer cone. A -semigroup is an affine semigroup such that the set is finite. Such -semigroups are central to our study. We develop new algorithms for computing -semigroups with specified invariants, including genus, Frobenius element, and their combinations, among other invariants. To achieve this, we introduce a new class of -semigroups, termed -semigroups. By fixing the degree lexicographic order, we also research the embedding dimension for both ordinary and mult-embedded -semigroups. These results are applied to test some generalizations of Wilf's conjecture.