Patterns on numerical semigroups.

From MaRDI portal
Publication:2369063

DOI10.1016/J.LAA.2005.11.007zbMATH Open1095.20039arXiv1912.04057OpenAlexW2135544701WikidataQ57728739 ScholiaQ57728739MaRDI QIDQ2369063FDOQ2369063


Authors: Maria Bras-Amorós, Pedro A. García Sánchez Edit this on Wikidata


Publication date: 28 April 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of the whole set of numerical semigroups. In particular, all semigroups can be arranged in an infinite non-stabilizing ascending chain whose first step consists just of the trivial semigroup and whose second step is the well known class of Arf semigroups. We escribe a procedure to compute the closure of a numerical semigroup with respect to a pattern. By using the concept of system of generators associated to a pattern we construct recursively a directed acyclic graph with all the semigroups admitting the pattern.


Full work available at URL: https://arxiv.org/abs/1912.04057




Recommendations




Cites Work


Cited In (15)

Uses Software





This page was built for publication: Patterns on numerical semigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369063)