Mixed linkage of numerical semigroup ideals

arXiv:2604.14478 · math.AC · Submitted 2026-04-15 · Read on arXiv

math.AC

Submitted: 2026-04-15

Updated: 2026-11-04

Comments: 14 pages. Substantially revised, with a new title and new results on mixed liaison classes, including sharp bounds in terms of the reduction number of the canonical ideal

Project page: https://gap-packages.github.io/numericalsgps

License: http://creativecommons.org/licenses/by/4.0/

The gist: We introduce principal and canonical linkage for relative ideals of a numerical semigroup S and study their interaction modulo translation.

Terminology

Abstract

We introduce principal and canonical linkage for relative ideals of a numerical semigroup S and study their interaction modulo translation. On normalized S-reflexive ideals, a principal link followed by a canonical link acts by addition of the canonical ideal K. The resulting mixed components have paths as their underlying simple graphs, and their even liaison classes are chains under inclusion. If r(K) is the positive reduction number of K, every even class has at most r(K) elements and every mixed component has at most 2r(K) vertices. For components with a loop, the bound improves to r(K). For semigroups of type two, we compute the even class of a given ideal from its occupied and gap blocks along arithmetic progressions and prove that the largest even class has exactly r(K) elements. This equality can fail in type three. Both component bounds are sharp, and explicit families of embedding dimension three give components of unbounded size with and without loops.

Related papers