A computational approach to the study of finite-complement submonids of an affine cone
Abstract
Let C⊂eq Np be an integer cone. A C-semigroup S⊂eq C is an affine semigroup such that the set C S is finite. Such C-semigroups are central to our study. We develop new algorithms for computing C-semigroups with specified invariants, including genus, Frobenius element, and their combinations, among other invariants. To achieve this, we introduce a new class of C-semigroups, termed B-semigroups. By fixing the degree lexicographic order, we also research the embedding dimension for both ordinary and mult-embedded N2-semigroups. These results are applied to test some generalizations of Wilf's conjecture.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.