Nonhomogeneous patterns on numerical semigroups.

DOI10.1142/S0218196713500306MaRDI QIDQ2854968zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maria Bras-Amorós, Albert Vico-Oton, Pedro A. García Sánchez

Publication date 24 October 2013

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

Frobenius varietiesminimal sets of generatorsnumerical semigroupspatterns

Mathematics Subject Classification ID

Commutative semigroups (20M14)

Abstract: Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers belonging to the semigroup. In a first approach, only homogeneous patterns where analized. In this contribution we study conditions for an eventually non-homogeneous pattern to be admissible, and particularize this study to the case the independent term of the pattern is a multiple of the multiplicity of the semigroup. Moreover, for the so called strongly admissible patterns, the set of numerical semigroups admitting these patterns with fixed multiplicity $m$ form an $m$-variety, which allows us to represent this set in a tree and to describe minimal sets of generators of the semigroups in the variety with respect to the pattern. Furthermore, we characterize strongly admissible patterns having a finite associated tree.

Review text

Numerical semigroups \(\Lambda\) are submonoids of the natural numbers with only finitely many missing numbers. The size of the gap is called the genus and the first nonzero element the multiplicity. The largest number not in the semigroup is called the Frobenius number.NEWLINENEWLINE The authors of this paper define the notion of a pattern by taking a polynomial \(P\) in \(n\) variables with integer coefficients and saying that a numerical semigroup admits the pattern if for any elements \(x_1,\ldots,x_n\in\Lambda\) with \(x_1\geq\cdots\geq x_n\), \(P(x_1,\ldots,x_n)\) is again in \(\Lambda\). This is a generalisation of the so called Arf semigroups where the polynomial is of the form \(x_1+x_2-x_3\).NEWLINENEWLINE This paper focuses on the case when the polynomial is of degree 1. It is said to be homogeneous if the free term is zero and the first part of the paper deals with these kinds of patterns. The authors give conditions on the coefficients as to when the set of semigroups admitting a given pattern is nonempty.NEWLINENEWLINE The second part deals with the nonhomogeneous case, more precisely when the constant term is a multiple of the multiplicity of the semigroup. Under some additional conditions on the polynomial (called strongly admissible) the set of semigroups satisfying them has the structure of an \(m\)-variety (or called nonhomogeneous Frobenius variety of multiplicity \(m\)) which allows for the description of the minimal sets of generators of the semigroups admitting these patterns.

Recommendations

• Patterns on numerical semigroups.
• Gaps in nonsymmetric numerical semigroups.
• Patterns of ideals of numerical semigroups
• On numerical semigroups
• On numerical semigroups
• scientific article; zbMATH DE number 5904513
• scientific article; zbMATH DE number 5898586
• Homogeneous numerical semigroups
• A note on pseudo-symmetric numerical semigroups.
• On numerical semigroups and the order bound.

Cites work

• Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
• Arf numerical semigroups.
• Bounding the number of \(\mathbb F_q\)-rational places in algebraic function fields using Weierstrass semigroups
• Bounding the number of points on a curve using a generalization of Weierstrass semigroups
• Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
• Numerical Semigroups Having a Toms Decomposition
• Numerical semigroups.
• On the parameters of algebraic-geometry codes related to Arf semigroups
• Patterns on numerical semigroups.
• Places of degree one in function fields over finite fields
• Strongly perforated K0-groups of simple C∗-algebras.
• Systems of proportionally modular Diophantine inequalities.
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
• The semigroup of combinatorial configurations

Cited in

(14)

• Frobenius restricted varieties in numerical semigroups
• Modular Frobenius pseudo-varieties
• Frobenius pseudo-varieties in numerical semigroups.
• Patterns on numerical semigroups.
• Linear, non-homogeneous, symmetric patterns and prime power generators in numerical semigroups associated to combinatorial configurations.
• The numerical semigroup of the integers which are bounded by a submonoid of \(\mathbb N^2\).
• Generalizing strong admissibility of patterns of numerical semigroups
• Bracelet monoids and numerical semigroups
• Patterns of ideals of numerical semigroups
• A combinatorial problem and numerical semigroups
• Sets of positive integers closed under product and the number of decimal digits
• Numerical semigroups in a problem about economic incentives for consumers
• Patterns on the Numerical Duplication by Their Admissibility Degree
• Numerical semigroups in a problem about cost-effective transport

This page was built for publication: Nonhomogeneous patterns on numerical semigroups.

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