Abstract
Let S and T be two numerical semigroups. We say that T is an -semigroup if is an ideal of S. Given k a positive integer, we denote by the symmetric numerical semigroup generated by . In this paper we present a formula which calculates the number of -semigroups with genus for some nonnegative integer h and which we will denote by . As a consequence, we obtain that the sequence is never decreasing. Besides, it becomes stationary from a certain term.
MSC:
20M14 (Primary); 05A15 (Secondary)
1. Introduction
Let be the set of integer numbers and let the set of nonnegative integers. A nonempty subset S of is a numerical semigroup, if it verifies the following conditions: it is closed under addition, and is finite.
If S is a numerical semigroup, then there exist three important invariants to the study of a numerical semigroups. They are the multiplicity, the Frobenius number and the genus of S, which are defined, respectively, as , and (where denotes the cardinality of X).
Given A a nonempty subset of , we consider the submonoid of generated by A, that is,
In ([1], Lemma 2.1) it is proven that is a numerical semigroup if and only if .
If S is a numerical semigroup where , then A is called a system of generators of S. Moreover, if for then A will be called a minimal system of generators of S. In [1], it is proven that every numerical semigroup admits a unique minimal system of generators. Besides, this minimal system of generators is finite. The minimal system of generators of S will denoted by and its cardinality is called the embedding dimension of S and it is denoted by
A numerical semigroup S is symmetric if it verifies the following condition: if , then if and only if In ([1], Corollary 4.7) it is proven that every numerical semigroup of embedding dimension two is symmetric. The introduction of these semigroups is due mainly to Kunz, who proves in [2] that a one-dimensional analytically irreducible Noetherian local ring is Gorenstein if and only if its value semigroup is symmetric. This has motivated that the symmetric numerical semigroups have been the numerical semigroup most studied in the literature.
If , it is clear that is a numerical semigroup with multiplicity 2 and it is known that every numerical semigroup with multiplicity 2 has this form.
If S is a numerical semigroup, then by Proposition 2.10 from [1], we know that When we say that S is a numerical semigroup with maximal embedding dimension (MED-semigroup, see [3]). By Remark 4.21 from [1], we know that is the set formed by all the symmetric numerical semigroups with maximal embedding dimension.
If A and B are nonempty subsets of , then we will consider the following set Let S be a numerical semigroup. An ideal of S is a subset nonempty P of S such that The ideals of a numerical semigroup have been extensively studied, see for example [4,5,6,7].
If S is a numerical semigroup and P is an ideal of S, then is a numerical semigroup. This fact induces us to give the following definition. A numerical semigroup T is an -semigroup if is an ideal of S.
If T is an -semigroup, then T is a numerical semigroup and . Therefore,
In [8] Bras-Amorós computed the number of numerical semigroups with genus g for and she proved that the sequence of the number of numerical semigroup with a fixed genus less than or equal to 50 has a behaviour similar to Fibonacci sequence. She also surmised that, in general, for a fixed integer g there are more numerical semigroups with genus than numerical semigroups with genus g. Despite extensive research into this problem, it remains to be solved. For this reason, determining the number of numerical semigroups with a given genus has become a question of great interest (see for instance [8,9,10,11,12,13,14]).
If , we denote by Denote by the cardinality of
In ([15]) we have conjectured the following: if S is a numerical semigroup, then there exists such that if , then and for all
A numerical semigroup S is ordinary if (the symbol → means that every integer greater than belongs to the set). In [15] we also show that the previous conjecture is true for ordinary numerical semigroups.
The purpose of the present work is to demonstrate that, given k a positive integer and , then
where for all
Therefore, if , then we have and for all
This result proves that the conjecture proposed by M. Bras-Amorós in [8] is true for this family of symmetric numerical semigroups. Moreover, we have taken a step forward towards the resolution of the conjecture, since our result asserts that there exist families of numerical semigroups where the number of semigroups with genus g is equal to the number of semigroups with genus from some genus.
The contents of this work are organized as follows. In Section 2 we give some concepts and results used during this work. All of them appear in [15]. In Section 3 we show a characterization of -incomparable set. This is the content of Proposition 4. Afterwards, we obtain the expresion of genus of an -semigroup, according to the -incomparable set, X. Finally, we prove Theorem 1, which is the main result of the work. We finish the Section and the paper by providing an example illustrating the theorem. Specifically, this example calculates the monotone increasing sequence of the number of -semigroups with a fixed genus. In this example we can see that the sequence becomes stationary in the genus
2. Results and Basic Concepts
In Proposition 1 from [15], appears the following result.
Proposition 1.
Let S be a numerical semigroup and let X be a subset nonempty of S, thenis an ideal of S. Moreover, every ideal of S has this form.
Given S a numerical semigroup, then we define the following order relation in S: if
A S-incomparable set is a subset nonempty X of S verifying that for all such that
The content of the following proposition is Theorem 5 from [15].
Proposition 2.
If S is a numerical semigroup, then the set
is the set composed by all the ideals of S. Moreover, if X and Y are two S-incomparable sets with, then
The following result is Proposition 7 from [15].
Proposition 3.
Let S be a numerical semigroup and let X be a S-incomparable set, then X is finite.
3. The Main Result
Given the numerical semigroup generated by will be denoted by . Our first purpose in this section will be to show how the -incomparable sets are.
The Frobenius problem for numerical semigroups consists in finding formulas for the Frobenius number and genus of a numerical semigroup by using its minimal system of generators. This problem was solved by Sylvester in [16] for numerical semigroups with embedding dimension two. Specifically, Sylvester proves that if a and b are positive integers greater than or equal to two and , then and At the present time, the Frobenius problem is still open for embedding dimension greater than or equal to three (see [17]). The following result has an immediate proof.
Lemma 1.
If k is a positive integer, then
Moreover,and
Proposition 4.
Let X be a nonempty subset of. Then X is a-incomparable set if and only if one of the following conditions is verified:
- (1)
- for somesuch that a is even.
- (2)
- for somesuch that a is odd and
- (3)
- with, a is even, b is odd,and
Proof.
(Necessity). Initially, note that if and then x and y have different parity. Therefore, if X has cardinality greather than or equal to two, then where , a is even, b is odd, and . In addition, and so
(Sufficiency). Trivial. □
The following result is deduced from Proposition 9 in [7].
Lemma 2.
Given S a numerical semigroup,and we consider the setthenand
Proposition 5.
Letbe a-incomparable set and we consider the numerical semigroupThen
- (1)
- If, then
- (2)
- Ifwhere a is even and b is odd, then
Proof.
- (1)
- It is a trivial consequence from Lemma 2.
- (2)
- By Proposition 4, and And by Lemma 1,because and . Therefore the genus of S is
□
At this point, after these results, it is possible for us to validate the Theorem announced in the Introduction.
Theorem 1.
If, then
Proof.
- (1)
- In the first place, we focus on the calculation of all the elements of the set which have the form being By 1) from Proposition 5, Thus, if , then As then by applying Lemma 1, we deduce the following:
- If h is odd, then contains a unique element which has the shape
- If h is even and , then does not contain any element with the form
- If h is even and , then contains a unique element whit the shape
- (2)
- In the second place, let us see how many elements there are in which have the form , where a is even, b is odd, andBy 2) from Proposition 5, we know that and, in consequence we have . Therefore, belongs to if and only if , , , a is even, b is odd and We distinguish the following cases:
- As , then
- As and , then
- As and , then
As a consequence of these three previous cases, we can say that the number of elements of which have the form coincides with the cardinality of the setNote thatNow, we are going to study these two cases:- If , then where for all
- If , then
- (3)
- Finally, we are able to affirm the following:
- If then, according to previous points (1) and (2), we deduce thatSo
- If then, according again to the previous points (1) and (2), we assert that
□
Example 1.
The increasing sequence of the number of-semigroups with a fixed genus is the following:
- for all
4. Conclusions
This paper is devoted to study the number of -semigroups with a fixed genus for a particular case of symmetric numerical semigroup S. That is, numerical semigroups which have the form , being We have proved that, in this case, the sequence of the number of -semigroups with a fixed genus, follows a nondecreasing sequence.
We have performed many calculations for this problem and all of them show that this sequence is a nondecreasing sequence for every numerical semigroup considered. For this reason, in future works, we are going to study the behaviour of this sequence in other families of numerical semigroups. Also, we want to obtain the formula of the bound where the sequence becomes stationary.
Author Contributions
All authors have contributed equally. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the regional research groups FQM-298 and FQM-343 (Junta de Andalucia/Feder) and by the project MTM2017-84890-P.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
The authors would like to thank the reviewers for their useful comments and suggestions that helped to improve this work.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Rosales, J.C.; García-Sánchez, P.A. Numerical Semigroups. In Developments in Mathematics; Springer: New York, NY, USA, 2009; Volume 20. [Google Scholar]
- Kunz, E. The value-semigroups of a one-dimensional Gorenstein ring. Proc. Amer. Math. Soc. 1970, 25, 748–751. [Google Scholar] [CrossRef]
- Rosales, J.C.; García-Sánchez, P.A.; García-García, J.I.; Urbano-Blanco, J.M. Numerical semigroup with maximal embedding dimension. Int. J. Commutative Ring 2003, 2, 47–53. [Google Scholar]
- Anderson, D.D.; Johnson, E.R. Ideal Theory in Commutative Semigroups. Semigroup Forum 1984, 30, 125–158. [Google Scholar] [CrossRef] [Scilit]
- Rosales, J.C.; García-Sánchez, P.A.; García-García, J.I. Irreducible ideals of finitely generated commutative monoids. J. Algebra 2001, 238, 328–344. [Google Scholar] [CrossRef] [Scilit]
- Rosales, J.C.; García-Sánchez, P.A.; García-García, J.I. Ideals of finitely generated commutative monoids. Semigroup Forum 2003, 66, 305–322. [Google Scholar] [CrossRef] [Scilit]
- Rosales, J.C. Principal ideals of numerical semigroups. Bull. Belg. Math. Soc. Simon Stevin 2003, 10, 329–343. [Google Scholar] [CrossRef] [Scilit]
- Bras-Amorós, M. Fibonacci-like behavior of the number of numerical semigroups of a given genus. Semigroup Forum 2008, 76, 379–384. [Google Scholar] [CrossRef] [Scilit]
- Blanco, V.; Rosales, J.C. The set of numerical semigroups of a given genus. Forum Math. 2012, 85, 255–267. [Google Scholar] [CrossRef] [Scilit]
- Bras-Amorós, M. Bounds on the number of numerical semigroups of a given genus. J. Pure Appl. Algebra 2008, 213, 997–1001. [Google Scholar] [CrossRef] [Scilit]
- Elizalde, S. Improved bounds on the number of numerical semigroups of a given genus. J. Pure Appl. Algebra 2010, 214, 1862–1873. [Google Scholar] [CrossRef] [Scilit]
- Kaplan, N. Counting numerical semigroups by genus and some cases a question of Wilf. J. Pure Appl. Algebra 2012, 216, 1016–1032. [Google Scholar] [CrossRef] [Scilit]
- Zhao, Y. Constructing numerical semigroup of a given genus. Semigroup Forum 2009, 80, 242–254. [Google Scholar] [CrossRef] [Scilit]
- Zhai, A. Fibonacci-like growth of numerical semigroups with a given genus. Semigroup Forum 2013, 86, 634–662. [Google Scholar] [CrossRef] [Scilit]
- Moreno-Frías, M.A.; Rosales, J.C. The ideals of a numerical semigroup. Counting the ideals with a given genus of an ordinary numerical semigroup Prepint.
- Sylvester, J.J. Mathematical question with their solutions. Educational Times 1884, 41, 21. [Google Scholar]
- Ramírez Alfonsín, J.L. The Diophantine Frobenius Problem; Oxford University Press: London, UK, 2005. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).