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
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
- Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
- A Linear Diophantine Problem
- Title not available (Why is that?)
- On the linear diophantine problem of Frobenius.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a Problem of Partitions
- The minimum distance of codes in an array coming from telescopic semigroups
- A note on Hermitian codes over GF(q/sup 2/)
- Arf numerical semigroups.
- On the parameters of algebraic-geometry codes related to Arf semigroups
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
- Une Interprétation Algébrique de la Suite des Ordres de Multiplicité D'une Branche Algébrique
- Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
- The oversemigroups of a numerical semigroup.
Cited In (15)
- Patterns in semigroups associated with combinatorial configurations
- Modular Frobenius pseudo-varieties
- Parametrizing Arf numerical semigroups
- Patterns on the Numerical Duplication by Their Admissibility Degree
- The graphic structure of a numerical semigroup
- Frobenius restricted varieties in numerical semigroups
- Bracelet monoids and numerical semigroups
- Patterns of ideals of numerical semigroups
- Numerical semigroups in a problem about economic incentives for consumers
- Generalizing strong admissibility of patterns of numerical semigroups
- Numerical semigroups whose fractions are of maximal embedding dimension.
- On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
- Nonhomogeneous patterns on numerical semigroups.
- Linear, non-homogeneous, symmetric patterns and prime power generators in numerical semigroups associated to combinatorial configurations.
- A decomposition of partitions and numerical sets
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)