Patterns on the numerical duplication by their admissibility degree

Alessio Borzì

doi:10.1007/978-3-030-40822-0_2

paper

Patterns on the numerical duplication by their admissibility degree

arXiv:1901.10571 · doi:10.1007/978-3-030-40822-0_2

Abstract

We develop the theory of patterns on numerical semigroups in terms of the admissibility degree. We prove that the Arf pattern induces every strongly admissible pattern, and determine all patterns equivalent to the Arf pattern. We study patterns on the numerical duplication $S ⋈^{d} E$ when $d ≫ 0$ . We also provide a definition of patterns on rings.