Patterns on numerical semigroups.

DOI10.1016/J.LAA.2005.11.007MaRDI QIDQ2369063zbMATH OpenOpenAlexWikidataFDO

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)

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

zbMATH Keywords

Arf semigroupsclosuresnumerical semigroupspatterns

Mathematics Subject Classification ID

Commutative semigroups (20M14)

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.

Review text

A pattern \(p\) of length \(n\) is a linear homogeneous polynomial with non-zero integer coefficients in \(n\) variables. A numerical semigroup \(\Lambda\) admits a pattern \(p\) if for every increasing sequence of elements in \(\Lambda\), \(s_i\), (\(1\leq i\leq n\)), \(p(s_1,\dots,s_n)\in\Lambda\). Those numerical semigroups admitting the pattern \(x_1+x_2-x_3\) are called Arf numerical semigroups. In this paper, the authors introduce the concept of pattern, which allows them to classify the whole set of numerical semigroups, arranging them in an infinite non-stabilizing ascending chain. Moreover they describe how to compute the closure of numerical semigroups with respect to patterns. Since both numerical and Arf numerical semigroups are widely used in coding theory, it could be expected some applications to this theory by using some of the described new semigroups.

Recommendations

• Generalizing strong admissibility of patterns of numerical semigroups
• Nonhomogeneous patterns on numerical semigroups.
• Arf numerical semigroups.
• Patterns of ideals of numerical semigroups
• The arithmetic extensions of a numerical semigroup

Cites work

• A Linear Diophantine Problem
• A note on Hermitian codes over GF(q/sup 2/)
• A simple approach for construction of algebraic-geometric codes from affine plane curves
• Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
• Arf numerical semigroups.
• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 3101854 (Why is no real title available?)
• Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
• Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
• On a Problem of Partitions
• On the linear diophantine problem of Frobenius.
• On the parameters of algebraic-geometry codes related to Arf semigroups
• The minimum distance of codes in an array coming from telescopic semigroups
• The oversemigroups of a numerical semigroup.
• Une Interprétation Algébrique de la Suite des Ordres de Multiplicité D'une Branche Algébrique

Cited in

(15)

• Frobenius restricted varieties in numerical semigroups
• On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
• The graphic structure of a numerical semigroup
• Modular Frobenius pseudo-varieties
• A decomposition of partitions and numerical sets
• Linear, non-homogeneous, symmetric patterns and prime power generators in numerical semigroups associated to combinatorial configurations.
• Nonhomogeneous patterns on numerical semigroups.
• Generalizing strong admissibility of patterns of numerical semigroups
• Bracelet monoids and numerical semigroups
• Patterns of ideals of numerical semigroups
• Patterns in semigroups associated with combinatorial configurations
• Parametrizing Arf numerical semigroups
• Numerical semigroups in a problem about economic incentives for consumers
• Patterns on the Numerical Duplication by Their Admissibility Degree
• Numerical semigroups whose fractions are of maximal embedding dimension.

Describes a project that uses

Uses Software

• NumericalSemigroupsWithGenus

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)