Affine Semigroups Without Consecutive Small Elements
Open Access
- 1 January 2026
- journal article
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1) , 9042510
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.Keywords
Funding Information
- Universidad de Cádiz
This publication has 13 references indexed in Scilit:
- The covariety of numerical semigroups with fixed Frobenius numberJournal of Algebraic Combinatorics, 2024
- Numerical semigroups without consecutive small elementsInternational Journal of Algebra and Computation, 2022
- Characterizing affine ${\mathcal {C}}$-semigroupsRicerche di Matematica, 2022
- On pseudo-Frobenius elements of submonoids of $\mathbb {N}^d$Collectanea Mathematica, 2019
- The Diophantine Frobenius Problem2005
- Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domainsMemoirs of the American Mathematical Society, 1997
- On the theory of graded structuresJournal of Symbolic Computation, 1986
- On the associated graded ring of a local Cohen-Macaulay ringKyoto Journal of Mathematics, 1977
- General Theory of Saturation and of Saturated Local Rings. III. Saturation in Arbitrary Dimension and, in Particular, Saturation of Algebroid HypersurfacesAmerican Journal of Mathematics, 1975
- Stable Ideals and Arf RingsAmerican Journal of Mathematics, 1971