Abstract
We consider numerical semigroups , which are minimally generated by three positive integers. We revisit the Wilf question for and, making use of identities for degrees of syzygies of such semigroups, we provide a short proof of existence of an affirmative answer. Finally, we find the upper and lower bounds for the rescaled genera of numerical semigroups .
MSC:
20M14; 11P81
1. Introduction
Let a numerical semigroup be minimally generated by a set of natural numbers , where
and none of its generators is linearly representable by the rest of them. The generating function of , denoted as , is defined as
This function is referred to as the Hilbert series of and has a rational representation (Rep),
where and denote degrees of the syzygies. The Frobenius number, , is the largest integer that cannot be represented as a linear combination of the elements in the triple with non-negative integer coefficients. When shifting by one unit to , it is often used in commutative algebra and is referred to as the conductor of . The largest degree, , is related to by the following equation:
Here and stand for the set of non-representable integers (gaps) and the genus of the semigroup , respectively.
The set comprises two sorts of gaps: (1) those such that and (2) those such that . Such a dichotomy in the set leads to a simple inequality:
The equality is attained if and only if the semigroup is symmetric, in which case consists only of gaps of the first sort. In fact, (2) holds for semigroups of any m, i.e., , where denotes a conductor.
In 1978, Wilf [1] posed two questions, which are often referred to as Wilf’s questions (WQs). The first of them was the following: is it true that for a given , the inequality
holds, with equality only for the generators ? In a seminal paper [2], by means of an embedding procedure for a sequence of partial gapsets of semigroup , it was shown that
where denotes the type of . Inequality (4) coincides with (3) if , but it does not imply (3) for . Over the last decade, a vast body of the literature [3,4,5,6,7] has been devoted to Wilf’s question. Despite the attention it has attracted in various special cases, it remains completely unsolved for the non-symmetric semigroups , .
Based on the polynomial identities for the degrees of syzygies [8], the present paper suggests quite different approach to obtain an affirmative answer to WQ in semigroups . Within this framework, we also derive the lower bound for , as well as the lower and upper bounds for rescaled genera of . From the perspective of WQ, the developed approach can be applied to semigroups , . We discuss this broader perspective in the final section.
2. Syzygy Identities for Numerical Semigroups
Consider a numerical semigroup and write the polynomial identities (see [8], Theorem 1) for the degrees of syzygies and . Denote by and the following two power sums:
Consider a set of polynomial equations for five real variables, , , , y, and :
The coefficients exhibit a linear combination of the higher genera of the numerical semigroup , i.e., for (see Formulas (22) and (23) in [9]).
E.g.,
Explicit expressions of are given in [9], in Formula (27).
2.1. Lower Bound of
Utilizing Newton–Maclaurin inequalities (see [10], p. 52) for the power sums and ,
and substituting Equalities (6)a and (6)b into inequality (8)a, we get
By equality (5)b, we find a relationship between and ,
and substitute it into (9). So, we find the following inequality:
Denote u as the ratio and rescale Inequality (11) by , dividing by , as follows:
We find a range of where Inequality (12) is satisfied for any . Since a convex function reaches its minimum at , we arrive at Davison’s lower bound [11] for ,
In fact, more accurate reasoning [12], such as the constraint , leads to a slightly stronger bound, .
2.2. Lower and Upper Bounds of
We introduce elementary symmetric polynomials in three variables,
which are related by Newton’s recursion identities to power sums , defined in (5)a:
Recall the Newton–Maclaurin inequalities (see [10], p. 52) for polynomials :
Consider the second inequality in (15)a, and substitute the identities from (14) into it:
Next, substitute the first three equalities (6)a,b,c into the last inequality:
Combining the identity for power sums, , and the relation in (10), we simplify (16) to obtain
We introduce two new variables, v and :
Rescaling (17) by dividing both sides by , we arrive at the following inequality:
In (18), v is bounded from above due to the constraint in (13) and is bounded from below due to the constraint in (2).
Lemma 1.
Proof.
Determine the upper bound of and express Inequality (19) as
On the other hand, the inequality always holds. To find the maximal value of while both inequalities are still satisfied, we must choose a value for v that provides the minimal value of within the interval . This occurs at at .
Figure 1 presents the plot of the function and the points for ten semigroups .
Figure 1.
Plot of the function and the points for semigroups (yellow), (purple), (blue), (red), (magenta), (cyan), (green), (black), (gray), and (orange).
2.3. Wilf’s Question for
We prove that WQ has an affirmative answer for all non-symmetric semigroups and start with . Using Lemma 6 in [13], which establishes inequalities for such semigroups, we get
By replacing the strict inequality on the r.h.s. of (21) with a non-strict one, , we arrive at .
Consider numerical semigroups with . Using the relation , the definition of (18), and the expression for (7), we can represent Inequality (20) in Lemma 1 for the upper bound as follows:
A sufficient (not necessary) condition for an affirmative answer to WQ is the inequality .
Theorem 1.
Let be a non-symmetric numerical semigroup with . When its generators satisfy Condition (1), WQ is answered affirmatively for all semigroups .
Proof.
Instead of , consider its inverse, , and apply Inequality (13),
According to Equation (23), a sufficient (but not necessary) condition to provide is the Diophantine inequality:
Analyze its solvability for different triples . To perform this, represent (24) as follows:
This necessarily yields a lower bound of the product :
Here, the concave function reaches its minimum (see Figure 2).
Figure 2.
Plot of functions (in magenta) and (in black). The blue dots correspond to semigroups with , . The ten small and three large red dots correspond to semigroups with , , and , , respectively. These semigroups are listed in Table 1.
The criterion (25) must be supplemented by an additional restriction, , or
The first values of the descendant sequence are given below:
The final criterion for generators to satisfy (25) reads
A brief analysis of (26) and the restriction yields a short list of non-symmetric semigroups with , where Inequality (24) might be broken. Below, we present Table 1, which lists the 13 semigroups for which .
Table 1.
Thirteen semigroups , where .
2.4. Lower and Upper Bounds of Rescaled Genera ,
Having successfully calculated the bounds of the rescaled genus in Lemma 1, it makes sense to extend these calculations for the higher rescaled genera for numerical semigroups , using the polynomial Equation (6) with . Utilizing the relationships among [9], we derive their expressions through the three independent parameters, u, v, and . The calculation of the bounds for is noteworthy from several points of view, e.g., observing their change when passing from a non-symmetric semigroup to a symmetric one.
Consider the following four syzygy identities (6):
By substituting the polynomial relations and into the fourth of these identities (see [9], Formula (37)),
we obtain
Continuing by substituting the first three identities from (28) and one more, , into (29), which yields
and combining this result with Identity (10), we arrive at an equality in and v:
By utilizing the bounds (12), (17) and (20) for and , we derive both lower and upper bounds for :
Next, supplement identity (28) with another identity from (6):
Then, substitute the polynomial relations and (see [9], Formula (37)), along with the other three first identities from (6) into (32). Skipping lengthy calculations, we present the final equality (see [9], Formula (39)),
and combine it with identity (10). The result is presented in the rescaled variables and v:
Making use of the bounds in (12), (17) and (20) for and , we arrive at lower and upper bounds for :
To study the bounds of the rescaled genera , , we utilize Theorem 2 in [9], applying it to the semigroups : there exists an algebraic equation, , where the polynomial is irreducible over the ring . To avoid giving lengthy formulas for , which increase with r, we instead present the specific algebraic equation for , making use of Formula (42) in [9]:
Substituting Equalities (30) and (33) into Equality (35), we obtain
which substantially simplifies Equality (35):
Utilizing the bounds given in (12), (17), (20) and (31), we derive lower and upper bounds for :
The following numerical calculations illustrate the upper and lower bounds in (20), (31), (34) and (36):
2.5. Rescaled Genera in Symmetric Semigroups
Every symmetric semigroup is a complete intersection [14]. Consequently, we can apply Formula (67) in [9] to calculate the first six rescaled genera , , and determine their lower and upper bounds. Bearing in mind that
we get
By utilizing (20) and comparing the upper and lower bounds in (31), (34) and (36) with those in (37), we conclude that the domain of variation for , , in non-symmetric semigroups encompasses the corresponding upper and lower bounds in symmetric semigroups :
We leave open a question of whether such a property exists for the other rescaled genera , with arbitrary , in numerical semigroups .
3. Concluding Remarks
We have revisited the Wilf question for numerical semigroups and, making use of identities for the degrees of syzygies of such semigroups, suggested a quite different approach to the proof of existence of an affirmative answer.
The proof technique elaborated in Theorem 1 could be extended to numerical semigroups for higher values of . However, there are two difficulties that make such reasoning hard to implement:
- The number of degrees in all syzygies for arbitrary numerical semigroups , , becomes unbounded (see [15] for ), while the number of polynomial equations, similarly to (6), up to degree m remains finite. This makes the algebraic estimation of extremely hard.
- The set of exceptional numerical semigroups , similarly to (27), with and exceeding their critical values, must be finite; otherwise a direct verification becomes impossible.
We plan to address this question in a separate paper.
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Acknowledgments
The author is grateful to the referees for their valuable suggestions, which improved this article.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Wilf, H.S. Circle-of-lights algorithm for the “money–changing problem”. Amer. Math. Mon. 1978, 85, 562–565. [Google Scholar] [CrossRef]
- Fröberg, R.; Gottlieb, C.; Häggkvist, R. On numerical semigroups. Semigroup Forum 1987, 35, 63–83. [Google Scholar] [CrossRef]
- Dobbs, D.; Matthews, G. On a question of Wilf concerning numerical semigroups. In Focus on Commutative Rings Research; Nova Science Publishers: New York, NY, USA, 2006; pp. 193–202. [Google Scholar]
- Moscariello, A.; Sammartano, A. On a conjecture by Wilf about the Frobenius number. Math. Z. 2015, 280, 47–53. [Google Scholar] [CrossRef]
- Eliahou, S. Wilf’s conjecture and Macaulay’s theorem. J. Eur. Math. Soc. 2018, 20, 2105–2129. [Google Scholar] [CrossRef]
- Delgado, M. Conjecture of Wilf: A survey. In Numerical Semigroups; Springer INdAM Series; Springer: Cham, Switzerland, 2020; Volume 40, pp. 39–61. [Google Scholar] [CrossRef]
- D’Anna, M.; Moscariello, A. Bounds for invariants of numerical semigroups and Wilf’s conjecture. Math. Z. 2023, 304, 35. [Google Scholar] [CrossRef]
- Fel, L.G. Restricted partition functions and identities for degrees of syzygies in numerical semigroups. Ramanujan J. 2017, 43, 465–491. [Google Scholar] [CrossRef]
- Fel, L.G. Genera of numerical semigroups and polynomial identities for degrees of syzygies. In Combinatorial and Additive Number Theory V; Springer Proceedings in Mathematics & Statistics; Springer: Cham, Switzerland, 2022; Volume 396, pp. 153–178. [Google Scholar] [CrossRef]
- Hardy, G.H.; Littlewood, J.E.; Polya, G. Inequalities; Cambridge University Press: Cambridge, UK, 1934. [Google Scholar]
- Davison, J.L. On the linear Diophantine problem of Frobenius. J. Number Theory 1994, 48, 353–363. [Google Scholar] [CrossRef]
- Fel, L.G. Frobenius problem for numerical semigroups S3. Func. Anal. Other Math. 2006, 1, 119–157. [Google Scholar] [CrossRef]
- Rosales, J.C. Numerical semigroups with multiplicity three and four. Semigroup Forum 2005, 71, 323–331. [Google Scholar] [CrossRef]
- Herzog, J. Generators and relations of Abelian semigroups and semigroup rings. Manuscripta Math. 1970, 3, 175–193. [Google Scholar] [CrossRef]
- Bresinsky, H. On prime ideals with generic zero xi = tni. Proc. Amer. Math. Soc. 1975, 47, 329–332. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. 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/).

