Counting numerical semigroups by genus and even gaps via Kunz-coordinate vectors
Matheus Bernardini

TL;DR
This paper establishes a bijection between certain numerical semigroups and points in a rational polytope, providing a new approach to analyze the sequence counting semigroups by genus.
Contribution
It introduces a novel correspondence between numerical semigroups with specific properties and rational polytope points, aiding in understanding their enumeration.
Findings
Provides a method to study the sequence of semigroups by genus
Offers a geometric perspective via polytope correspondence
Aims to determine if the sequence of counts is increasing
Abstract
We contruct a one-to-one correspondence between a subset of numerical semigroups with genus and even gaps and the integer points of a rational polytope. In particular, we give an overview to apply this correspondence to try to decide if the sequence is increasing, where denotes the number of numerical semigroups with genus .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Counting numerical semigroups by genus and even gaps via Kunz-coordinate vectors
Matheus Bernardini
Abstract.
We contruct a one-to-one correspondence between a subset of numerical semigroups with genus and even gaps and the integer points of a rational polytope. In particular, we give an overview to apply this correspondence to try to decide if the sequence is increasing, where denotes the number of numerical semigroups with genus .
2010 Math. Subj. Class.: Primary 20M14; Secondary 05A15, 05A19
Keywords: numerical semigroup, multiplicity, even gap, genus, Apéry set, Kunz-coordinate vector
1. Introduction
A numerical semigroup is a subset of such that , it is closed under addition and the set , the set of gaps of , is finite. The number of elements of is called the genus of and the first non-zero element in is called the multiplicity of . If is a numerical semigroup with genus then one can ensure that all gaps of belongs to ; in particular, and the number of numerical semigroups with genus , denoted by , is finite. Some excellent references for the background on numerical semigroups are the books [5] and [7].
Troughtout this paper, we keep the notation proposed by Bernardini and Torres [1]: the set of numerical semigroups with genus is denoted by and has elements and the the set of numerical semigroups with genus and even gaps is denoted by and has elements.
In this paper we use the quite useful parametrization
[TABLE]
where .
Naturally, the set and the map can be generalized. Let be an integer. The set of numerical semigroups with genus and gaps which are congruent to 0 modulo is denoted by . There is a natural parametrization given by
[TABLE]
where . This concept appears in [8], for instance.
In this paper, we obtain a one-to-one correspondence between the set and the integer points of a rational polytope.
As an application of this correspondence, we give a new approach to compute the numbers . Our main goal is finding a new direction to discuss the following question.
[TABLE]
The first few elements of the sequence are . Kaplan [6] wrote a nice survey on this problem and one can find information of these numbers in Sloane’s On-line Encyclopedia of Integer Sequences [10].
Bras-Amorós [3] conjectured remarkable properties on the behaviour of the sequence :
- (1)
; 2. (2)
; 3. (3)
for any .
Zhai [12] proved that is a constant. As a consequence, it confirms that items (1) and (2) hold true. However, item (3) is still an open problem; even a weaker version, proposed at (1.2), is an open question. Zhai’s result also ensures that for large enough . Fromentin and Hivert [4] verified that also holds true for .
Torres [11] proved that if, and only if, . Hence,
[TABLE]
In order to work on Question (1.2), Bernardini and Torres [1] tried to understand the effect of the even gaps on a numerical semigroup. By using the so-called -translation, they proved that for and also for . Although numerical evidence points out that holds true for all and , their methods could not compare numbers and , with . Notice that if , for then , for all .
2. Apéry set and Kunz-coordinate vector
Let be a numerical semigroup and . The Apéry set of (with respect to ) is the set . If , then and . If , then a there are such that , where .
Proposition 2.1**.**
Let be a numerical semigroup with multiplicity and . Then
[TABLE]
Proof.
It is clear that For , , there is such that . On the other hand, . ∎
Let be a numerical semigroup, and consider . There are such that , for each . The vector is called the Kunz-coordinate vector of (with respect to ). In particular, if is the multiplicity of , then the Kunz-coordinate vector of (with respect to ) is in . This concept appears in [2], for instance.
A natural task is finding conditions for a vector to be a Kunz-coordinate vector (with respect to the multiplicity of ) of some numerical semigroup with multiplicity . The following examples illustrate the general method, which is presented in Proposition 2.4.
Example 2.2**.**
Numerical semigroups with multiplicity are , where .
There is a one-to-one correspondence between the set of numerical semigroups with multiplicity and the set of positive integers given by .
Example 2.3**.**
Let be a numerical semigroup with multiplicity and genus , where . By minimality of and , satisfies
[TABLE]
The set of gaps of has elements, since . Thus, . On the other hand, if is such that , and , then is a numerical semigroup with multiplicity and genus .
Hence, there is a one-to-one correspondence between the set of numerical semigroups with multiplicity and the vectors of which are solutions of
[TABLE]
In order to give a characterization of numerical semigroups with fixed multiplicity and fixed genus, the main idea is generalizing Example 2.3. The following is a result due to Rosales et al. [8].
Proposition 2.4**.**
There is a one-to-one correspondence between the set of numerical semigroups with multiplicity and genus and the positive integer solutions of the system of inequalities
[TABLE]
Let be a numerical semigroup with multiplicity and genus , where . The main idea of the proof is using the minimality of and observing that and . For a full proof, see [8].
3. The main result and an application to a counting problem
In [1], the calculation of was given by
[TABLE]
In this section, we present a new way for computing those numbers. In order to do this, we fix the multiplicity of .
First of all, we obtain a relation between the genus and the multiplicity of a numerical semigroup.
Proposition 3.1**.**
Let be a numerical semigroup with genus and multiplicity . Then .
Proof If a numerical semigroup has multiplicity and genus with , then the number of gaps of would be, at least, and it is a contradiction. Hence .
Remark 3.2*.*
The bound obtained in Proposition 3.1 is sharp, since has genus has multiplicity .
If , then and . Hence, , for all . If , we divide the set into the subsets , where . We can write
[TABLE]
Putting (3.1) and (3.2) together, we obtain
[TABLE]
Thus, it is important to give a characterization for . We can describe by its Apéry set (with respect to its multiplicity ) and write
[TABLE]
where .
The next result characterizes all numerical semigroups of , for . It is a consequence of Proposition 2.4.
Theorem 3.3**.**
Let . A numerical semigroup belongs to if, and only if,
[TABLE]
where satisfies the system
[TABLE]
Proof The even numbers belongs to . Let be the odd numbers of . Thus, is the Kunz-coordinate vector of (with respect to ).
Now, we apply Proposition 2.4. Inequalites given in come from sums of an odd element of with an even element of , while inequalities given in come from sums of two odd elements of . Since is the Kunz-coordinate vector of (with respect to ), then the sum of two even elements of belongs to . Finally, last equality comes from the fact that has odd gaps.
Remark 3.4*.*
Some of the numbers can be zero. Hence, it is possible that the multiplicity of is not .
Example 3 Let , with . Theorem 3.3 ensures that if , then
[TABLE]
where satisties
[TABLE]
The set of integer points of this region is in one-to-one correspondence with the set .
If is fixed, then the set of points that satisfies the system is a polytope (a line segment). We are interested in the set of integer points of this polytope. The following figure shows examples for some values of . Each integer point represents a numerical semigroup of the set .
Let . After some computations, we obtain
[TABLE]
In particular, . We leave the following open question.
[TABLE]
A positive answer to Question (3.3) implies a positive answer to Question (1.2).
Acknowledgment. The author was partially supported FAPDF-Brazil (grant 23072.91.49580.29052018). Part of this paper was presented in the “INdAM: International meeting on numerical semigroups” (2018) at Cortona, Italy. I am grateful to the referee for their comments, suggestions and corrections that allowed to improve this version of the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Bernardini and F. Torres, Counting numerical semigroups by genus and even gaps , Disc. Math., 340 (2017), 2853–2863.
- 2[2] V. Blanco and J. Puerto, An application of integer programming to the decomposition of numerical semigroups , SIAM J. Discrete Math., 26(3) (2012), 1210-–1237.
- 3[3] M. Bras-Amorós, Fibonacci-like behavior of the number of numerical semigroups of a given genus , Semigroup Forum 76 (2008), 379–384.
- 4[4] J. Fromentin and F. Hivert, Exploring the tree of numerical semigroups , Math. Comp. 85 (301) (2016), 2553–2568.
- 5[5] P.A. García-Sánchez and J.C. Rosales, “Numerical semigroups”, Developments in Mathematics vol. 20 , Springer, New York, 2009.
- 6[6] N. Kaplan, Counting numerical semigroups , Amer. Math. Monthly 163 (2017), 375–384.
- 7[7] J.L. Ramírez-Alfonsín, “The Diophantine Frobenius Problem”, Oxford Univ. Press vol 30 , 2005.
- 8[8] J.C. Rosales, P.A. García-Sánchez, J.I. García-García and M.B. Branco, Systems of inequalities and numerical semigroups , J. London Math. Soc. (2), 65 (2002), 611–623.
