Affine Semigroups Without Consecutive Small Elements
J. C. Rosales, R. Tapia-Ramos, A. Vigneron-Tenorio
Source abstract
An ‐semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite‐complement submonoids of an affine cone . We develop algorithmic procedures to compute all ‐semigroups with a given Frobenius element (denoted by ) and with fixed Frobenius element and multiplicity. Moreover, we analyze the ‐systems of generators. Furthermore, we study ‐numerical semigroups with maximal embedding dimension, a fixed Frobenius number. and multiplicity, providing an algorithm for their computation and a graphical classification.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.