Skip to main content
Log in

On a question of Eliahou and a conjecture of Wilf

  • Published:
Mathematische Zeitschrift Aims and scope Submit manuscript

Abstract

To a numerical semigroup S, Eliahou associated a number \({{\mathrm{E}}}(S)\) and proved that numerical semigroups for which the associated number is non negative satisfy Wilf’s conjecture. The search for counterexamples for the conjecture of Wilf is therefore reduced to semigroups which have an associated negative Eliahou number. Eliahou mentioned 5 numerical semigroups whose Eliahou number is \(-1\). The examples were discovered by Fromentin who observed that these are the only ones with negative Eliahou number among the over \(10^{13}\) numerical semigroups of genus up to 60. We prove here that for any integer n there are infinitely many numerical semigroups S such that \({{\mathrm{E}}}(S)=n\), by explicitly giving families of such semigroups. We prove that all the semigroups in these families satisfy Wilf’s conjecture, thus providing not previously known examples of semigroups for which the conjecture holds.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Bras-Amorós, M.: Fibonacci-like behaviour of the number of numerical semigroups of a given genus. Semigroup Forum 76, 379–384 (2008)

  2. Delgado, M.: “ intpic”, A GAP Package for Drawing Integers, Version 0.2.1 (2015). http://www.gap-system.org/

  3. Delgado, M., García-Sánchez, P.A., Morais, J.: “ NumericalSgps”, A GAP Package for Numerical Semigroups, Version 1.0.1 (2015). http://www.gap-system.org/

  4. Eliahou, S.: Wilf’s conjecture and Macaulay’s theorem. arXiv:1703.01761 [math.CO]

  5. Fromentin, J., Hivert, F.: Exploring the tree of numerical semigroups. Math. Comput. 85, 2553–2568 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  6. Rosales, J.C., García-Sánchez, P.A.: Numerical Semigroups. In: Developments in Mathematics, vol. 20. Springer (2010)

  7. The GAP Group: GAP—groups, algorithms, and programming, Version 4.8.7 (2017). http://www.gap-system.org

  8. Wilf, H.: A circle-of-lights algorithm for the money-changing problem. Am. Math. Monthly 85, 562–565 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  9. Zhai, A.: Fibonacci-like growth of numerical semigroups of a given genus. Semigroup Forum 86, 634–662 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Besides the formal acknowledgement to the Centre for Mathematics of the University of Porto (CMUP) made somewhere in this paper, I would like to thank CMUP for providing me the computational tools necessary to this kind of works. I would like also to thank Shalom Eliahou for his suggestions and comments on preliminary versions. Special thanks to Shalom for encouraging me to publish this work. The anonimous referee, who carefully read the manuscript and gave me the appropriate remarks, deserves also my special ackowledgement.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manuel Delgado.

Additional information

Manuel Delgado was partially supported by CMUP (UID/MAT/00144/2013), which is funded by FCT (Portugal) with national (MCTES) and European structural funds (FEDER), under the partnership agreement PT2020, and also by the project MTM2014-55367-P.

Appendices

Appendix 1: A remark concerning the genus

Let n be an integer. Consider the set \(\mathcal S_n\) of numerical semigroups with Eliahou number n:

$$\begin{aligned} \mathcal S_n = \left\{ S\mid S \text { is a numerical semigroup such that }{{\mathrm{E}}}(S)=n\right\} . \end{aligned}$$

In Sect. 5 we proved that all the \(\mathcal S_n\)’s consist of infinitely many numerical semigroups. As a consequence, we have that, for all n, the set

$$\begin{aligned}GE_n = \left\{ {{\mathrm{genus}}}(S)\mid S \in \mathcal S_n\right\} \end{aligned}$$

of positive integers is, in particular, non empty and therefore has a minimum. Furthermore, since there are only finitely many numerical semigroups with a given genus, none of the \(GE_n\) is bounded (see below for an alternative proof).

We remark that Fromentin’s computations (see Sect. 2.4) show that the minimum of \(GE_{-1}\) is 43 and that if \(n<-1\), then \(\min GE_{n} > 60\).

A related and general question is:

Question 1

Le n be an integer. Find the minimum of \(GE_n\).

It seems to be difficult to get some hint on how to attack this question through (presently available) computational means. Finding some good bounds is probably challenging enough. To this end, we prove the following proposition:

Proposition 10

Let p be an even positive integer. Then

$$\begin{aligned}&{{\mathrm{genus}}}(S(p))= p\left( \frac{5}{24}p^2+\frac{13}{8}p+\frac{11}{12}\right) \end{aligned}$$

Proof

Using the fact that \({{\mathrm{c}}}(S(p))=p\mu \) (Corollary 3) and the formula for \(|{{\mathrm{L}}}(S(p))|\) given by Corollary 7, we get:

$$\begin{aligned} {{\mathrm{genus}}}(S(p))&=p\mu -|L|\\&=p\left( \frac{p^2}{4}+2p+2\right) -\left( \frac{p^3}{24}+\frac{3}{8}p^2 + \frac{13}{12}p\right) \\&=p\left( \frac{5}{24}p^2+\frac{13}{8}p+\frac{11}{12}\right) . \end{aligned}$$

\(\square \)

One can state similar results for the others families considered, namely for \(S^{(0,j)}(p,\tau )\).

Proposition 11

Let p be an even positive integer and let \(\tau \) and j be non-negative integers. Then

$$\begin{aligned} {{\mathrm{genus}}}(S^{(0,j)}(p,\tau ))={{\mathrm{genus}}}(S(p))+(\tau +j)\frac{p^2}{2}-\tau . \end{aligned}$$

Proof

By Proposition 7 and Proposition 9 (with \(i=0\)) we conclude that \({{\mathrm{c}}}(S^{(0,j)}(p,\tau ))= {{\mathrm{c}}}(S(p))+(\tau +j)\frac{p^2}{2}-\tau \). By Remark 11, all the semigroups under consideration have the same number of left elements: \(|{{\mathrm{L}}}(S(p)|\).

Since the Eliahou number of \(S^{(0,j)}(p,\tau )\) does not vary with j and, for any given n, there exist p and \(\tau \) such that \({{\mathrm{E}}}(S(p,\tau ))=n\), we have that \(\left\{ {{\mathrm{genus}}}(S^{(0,j)}(p,\tau ))\mid j\in \mathbb N\right\} \subseteq GE_n\). We can therefore conclude, as already observed, that the set \(GE_n\) is unbounded for any n.

Corollary 20

Let n be a negative integer and let \(p=\left\lceil 1 + \sqrt{1-8n}\right\rceil \). Then the numerical semigroup \(S=S\left( p,n-\frac{p}{4}(1-p/2)\right) \) is such that

$$\begin{aligned} {{\mathrm{genus}}}(S)=\frac{p}{4}\left( \frac{p^3}{4}+\frac{p^2}{3} +6p + \frac{14}{3}\right) + n\left( \frac{p^2}{2}-1\right) . \end{aligned}$$

In particular, we get the following bound:

$$\begin{aligned} \min GE_n \le \frac{p^4}{16}+\frac{p^3}{12} +\frac{3p^2}{2} + \frac{14p}{12} + n\left( \frac{p^2}{2}-1\right) . \end{aligned}$$
(13)

Proof

Recall that, by Corollary 16, \({{\mathrm{E}}}(S)=n\). By Proposition 11, we have:

$$\begin{aligned} {{\mathrm{genus}}}(S)&={{\mathrm{genus}}}(S(p))+\tau \left( \frac{p^2}{2}-1\right) \\&= p\left( \frac{5}{24}p^2+\frac{13}{8}p+\frac{11}{12}\right) + \left( n-\frac{p}{4}(1-p/2)\right) \left( \frac{p^2}{2}-1\right) \\&= \frac{p}{4}\left( \frac{5}{6}p^2+\frac{13}{2}p+\frac{11}{3}+\left( \frac{p}{2}-1\right) \left( \frac{p^2}{2}-1\right) \right) + n\left( \frac{p^2}{2}-1\right) \\&= \frac{p}{4}\left( \frac{5}{6}p^2+\frac{13}{2}p+\frac{11}{3}+ \frac{p^3}{4} -\frac{p^2}{2} -\frac{p}{2} +1\right) + n\left( \frac{p^2}{2}-1\right) \\&= \frac{p}{4}\left( \frac{p^3}{4}+\frac{p^2}{3} +6p + \frac{14}{3}\right) + n\left( \frac{p^2}{2}-1\right) \end{aligned}$$

\(\square \)

The bound given by Corollary 20 is not tight in general, as the below discussion shows.

For \(n=-1\) we have \(p=4\) and \(n-\frac{p}{4}(1-p/2)=0\). As we know, \(S(4)=\langle 14, 22, 23\rangle _{56}\) is such that \({{\mathrm{E}}}(S(4))=-1\) and \({{\mathrm{genus}}}(S(4))=43\), which is a minimum, by Fromentin’s computations. Evaluating \(\frac{p^4}{16}+\frac{p^3}{12} +\frac{3p^2}{2} + \frac{14p}{12} + n\left( \frac{p^2}{2}-1\right) \) with \(p=4\) and \(n=-1\) one gets 43. Therefore, we can state the following remark.

Remark 13

The bound given by Corollary 20 is tight for \(n=-1\).

The tightness is no longer true for \(n=-2\). In this case \(p=6\) and \({n-\frac{p}{4}(1-p/2)=1}\). We have \(S(6,1)=\langle 26, 44, 45\rangle _{155}\), which is a semigroup of genus 126 (one can compute it directly or evaluate the right side of (13) at \(p=6\) and \(n=-2\)). But one can verify that \(\langle 30, 44, 48, 49\rangle _{118}\) has genus 99 and Eliahou number \(-2\), thus 126 is not tight. We do not know whether 99 is tight.

Question 2

Is 99 the minimum possible genus of all the numerical semigroups satisfying \({{\mathrm{E}}}(S)=-2\)?

The bound given by Corollary 20 for \(n=-3\) is smaller than the one given for \(n=-2\) and we do not know whether it is tight. For \(n=-3\), we get \(p=6\) and \(n-\frac{p}{4}(1-p/2)=0\). The semigroup \(S(6,0)=\langle 23, 39, 40\rangle _{138}\) has genus 109 and Eliahou number \(-3\).

Question 3

Is 109 a lower bound for the set of genus of all numerical semigroups satisfying \({{\mathrm{E}}}(S)=-3\)?

Let us now make some comments on a possible attempt to solve Questions 2 and 3 by exhaustive search.

Denote by \(n_g\) the number of numerical semigroups of genus g and by \(N_g\) the number of numerical semigroups of genus not greater than g. The following was conjectured by Bras-Amoros [1] and proved by Zhai [9].

Proposition 12

The sequence of the number of numerical semigroups by genus behaves like the Fibonacci sequence, that is,

$$\begin{aligned} \lim _{g\rightarrow +\infty }\frac{n_{g-2}+n_{g-1}}{n_g}=1. \end{aligned}$$

This implies that \(\lim _{g\rightarrow +\infty }\frac{n_{g}}{n_{g-1}}=\varphi \), where \(\varphi \) is the golden ratio. Since the golden ratio is greater than 1, 61, it is not surprising that one can experimentally observe \(n_g \ge n_{g-1}\cdot (1.6)\) even for small g. This can be observed in the various tables available in the literature containing the numbers \(n_g\). The one that, to the best of our knowledge, goes the farthest is the one given by Fromentin and Hivert [5] where, in particular, the number of numerical semigroups of genus 67 is given: \(n_{67}=377,866,907,506,273\). Summing up the number of numerical semigroups of genus not greater 67, one gets

$$\begin{aligned} N_{67}=\sum _{g\in \{1,\ldots ,67\}}n_g\simeq 9.86\times 10^{14}. \end{aligned}$$

One can guess that the number of numerical semigroups of genus \(67+i\) is approximately \(n_{67}\cdot (1.6)^{i}\) and consequently

$$\begin{aligned} N_{109}=\sum _{g\in \{1,\ldots ,109\}}n_g\simeq 9.86\cdot 10^{14}+n_{67}\frac{(1.6)^{43}-1.6}{1.6-1}. \end{aligned}$$

By doing some computations (with several unfavourable rounding) one gets that the number of numerical semigroups up to genus 109 is well over \((3.2)\times 10^{23}\). It is out of reach using today’s computational means to do even the most trivial computation for such a number of semigroups.

Suppose that one could do some computation with \(10^6\) semigroups per second. The overall computation with the semigroups of genus up to 109 would require \((3.2)\times 10^{17}\) s. Taking into account that 1 year has less that \((1.6)\cdot 10^7\) s, the computation would take about \(2\times 10^{10}\) years, which is a little bit too much to wait for.

Although computing the Eliahou number of one numerical semigroup of small genus, up to 109, say, takes almost no time, the above discussion should make clear that exhaustive search is not satisfactory when one has to deal with huge numbers of numerical semigroups. Further theoretical results are needed.

To the best of our knowledge, exhaustive search has only been performed for semigroups up to genus 60. In particular, we are not able to guarantee that 61 is not the answer for one or both questions above.

Appendix 2: A variety of examples

Table 6 Sporadic semigroups with 4 left primitives
Table 7 Sporadic semigroups with 5 left primitives
Table 8 Sporadic semigroups with 3 large left primitives

In this section we give a number of examples of numerical semigroups whose Eliahou number is negative. We group these examples into various tables (Tables 6, 7 and 8). The choice of the examples, most of them obtained in the process that led to obtaining the families considered in the paper, deserves some comments. One of the aims is to furnish a source of (counter-) examples for some natural questions. Another one is to give some insight on possible answers to others. Others examples are probably mere curiosities, that, as frequently happens when doing experiments, may help to ask the appropriate questions.

How general are the families we considered in the paper? We believe that not much: its contribution to the characterization of \({\mathcal {E}}\) is probably very small. We present examples having more than 3 minimal left generators as well as examples where none of its pairs of minimal left generator consists of consecutive numbers. None of these examples is of the form \(S^{(i,j)}(p,\tau )\).

The tables presented in this appendix are similar to the ones that already appeared in the text, namely in Sect. 3.8 where an explanation for the meaning of the various columns is given. The only difference occurs in the first column: instead of the notation used for the semigroup, a number is used so that the examples in the table are numbered sequentially.

Several of our examples have more that 3 minimal left generators (see Tables 6 and 7). Thus we can state the following remark.

Remark 14

There exist numerical semigroups with more than 3 minimal left generators whose Eliahou number is negative.

Our examples just involve numerical semigroups with no more than 5 minimal left generators, but we would not be surprised if the following question has a negative answer.

Question 4

Is there an upper bound for the number of left primitives of the numerical semigroups in \({\mathcal {E}}\)?

Appendix 3: Wilf number of \(S^{(i,j)}(p\tau )\)

The aim of this section is to prove Theorem 4, which gives a formula in terms of ijp and \(\tau \) for the Wilf number of \(S^{(i,j)}(p,\tau )\).

Proof

By definition,

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&=|{{\mathrm{P}}}(S^{(i,j)}(p,\tau ))||{{\mathrm{L}}}(S^{(i,j)}(p,\tau )) |- {{\mathrm{c}}}(S^{(i,j)}(p,\tau )). \end{aligned}$$

Using Lemma 9, Lemma 10 and Proposition 9, we get

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&=\left( |{{\mathrm{P}}}(S(p,\tau ))|+j\frac{p}{2}\right) \left( |{{\mathrm{L}}}(S(p,\tau ))|+\frac{i}{48}(p^3+12p^2+44p+48)\right) \\&\quad - \left( {{\mathrm{c}}}(S(p,\tau ))+j\frac{p^2}{2} + i\left( \frac{p}{2}+1\right) m^{(i,j)}\right) \end{aligned}$$

Through small manipulations we get:

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&={{\mathrm{W}}}(S(p,\tau ))\nonumber \\&\quad + \frac{i}{48}|{{\mathrm{P}}}(S(p,\tau ))|(p^3+12p^2+44p+48) \end{aligned}$$
(14)
$$\begin{aligned}&\quad + j\frac{p}{2}\left( |{{\mathrm{L}}}(S(p,\tau ))|+\frac{i}{48}(p^3+12p^2+44p+48)\right) \end{aligned}$$
(15)
$$\begin{aligned}&\quad -\left( j\frac{p^2}{2} + i\left( \frac{p}{2}+1\right) \left( \frac{p^2}{4}+(\tau +j+4)\frac{p}{2}+2\right) \right) \end{aligned}$$
(16)

Now let us look separately to each of the numbered parcels. To deal with Parcel (14) we need to use Remark 6.

$$\begin{aligned}&\frac{i}{48}|{{\mathrm{P}}}(S(p,\tau ))|(p^3+12p^2+44p+48)\\&\quad = \frac{i}{8\cdot 48}\left( p^2+(6 + 4\tau ) p+16\right) \left( p^3+12p^2+44p+48\right) \\&\quad =\frac{i}{8\cdot 48}\left( p^5+ (12+(6+4\tau ))p^4+(60+12(6+4\tau ))p^3\right) \\&\quad \quad + \frac{i}{8\cdot 48}\left( (5\cdot 48+44(6+4\tau ))p^2+(44\cdot 16+48(6+4\tau ))p+48\cdot 16\right) \\&\quad =\frac{i}{8\cdot 48}\left( p^5+ (18+4\tau )p^4+(11\cdot 12+48\tau )p^3\right) \\&\quad \quad + \frac{i}{8\cdot 48}\left( (21\cdot 24+(11\cdot 16)\tau )p^2+(62\cdot 16 +48\cdot 4\tau ))p+16\cdot 48\right) \end{aligned}$$

To deal with Parcel (15) we need to use Remark 4 (see also Corollary 7).

$$\begin{aligned}&j\frac{p}{2}\left( |{{\mathrm{L}}}(S(p,\tau ))|+\frac{i}{48}(p^3+12p^2+44p+48)\right) \\&\quad = j\frac{p}{2}\left( \frac{p^3}{24}+\frac{3}{8}p^2 + \frac{13}{12}p+\frac{i}{48}(p^3+12p^2+44p+48)\right) \\&\quad = \frac{j}{2\cdot 48}\left( (i+2)p^4+(12i+ 18)p^3 + (44i+52)p^2+48ip\right) \end{aligned}$$

Next we rewrite Parcel (16):

$$\begin{aligned}&-\left( j\frac{p^2}{2} + i\left( \frac{p}{2}+1\right) \left( \frac{p^2}{4}+(\tau +j+4)\frac{p}{2}+2\right) \right) \\&\quad = -j\frac{p^2}{2} - \frac{i}{8}\left( p+2\right) \left( p^2+(8+2(\tau +j))p+8\right) \\&\quad = -j\frac{p^2}{2} -\frac{i}{8}\left( p^3+(10+2(\tau +j))p^2+(24+4(\tau +j))p+16\right) \end{aligned}$$

Joining up, we get:

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&={{\mathrm{W}}}(S(p,\tau ))\\&\quad + \left( \frac{i}{8\cdot 48} \right) p^5 \\&\quad + \left( \frac{i}{8\cdot 48}(18+4\tau ) + \frac{j}{2\cdot 48}(i+2) \right) p^4 \\&\quad + \left( \frac{i}{8\cdot 48}(11\cdot 12+48\tau ) + \frac{j}{2\cdot 48}(12i+ 18) -\frac{i}{8}\right) p^3 \\&\quad + \left( \frac{i}{8\cdot 48}(21\cdot 24+(11\cdot 16)\tau )+ \frac{j}{2\cdot 48}(44i+52)\right. \\&\quad \left. -\frac{i}{8}(10+2\tau +2j) -\frac{j}{2} \right) p^2 \\&\quad + \left( \frac{i}{8\cdot 48} (62\cdot 16 +48\cdot 4\tau ) + \frac{j}{2\cdot 48}48i -\frac{i}{8}(24+4(\tau +j)) \right) p \\&\quad + \left( \frac{i}{8\cdot 48}16\cdot 48 -\frac{i}{8} 16 \right) . \end{aligned}$$

We proceed by slightly manipulating the right side of the above equality.

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&={{\mathrm{W}}}(S(p,\tau ))+ \left( \frac{i}{8\cdot 48} \right) p^5 \\&\quad + \left( 3i/64+j/48 + ij/96+ i\tau /96\right) p^4 \\&\quad + \left( 7i/32 + 3j/16+ ij/8 +i\tau /8\right) p^3 \\&\quad + \left( i(21/16+11/24\tau )+ 11ij/24\right. \\&\quad + \left. 13j/24 -5i/4 -i\tau /4-ij/4 -j/2 \right) p^2 \\&\quad + i\left( 31/12 +\tau /2 + j/2 -3-\tau /2-j/2 \right) p \\&\quad + \left( 2i - 2i \right) . \end{aligned}$$

Simplifying a bit further:

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&={{\mathrm{W}}}(S(p,\tau ))+ \left( \frac{i}{8\cdot 48} \right) p^5 \\&={{\mathrm{W}}}(S(p,\tau ))+ \left( \frac{i}{8\cdot 48} \right) p^5 \\&\quad + \left( 3i/64+j/48 + ij/96+ i\tau /96\right) p^4 \\&\quad + \left( 7i/32 + 3j/16+ ij/8 +i\tau /8\right) p^3 \\&\quad + \left( i/16 +j/24 +5ij/24 + 5i\tau /24 \right) p^2 \\&\quad - \frac{5i}{12}p. \end{aligned}$$

Next we use Proposition 8 and Proposition 6 to obtain the requested expression.

$$\begin{aligned} {{\mathrm{W}}}(S^{(i,j)}(p,\tau ))&=\frac{p^5}{192}+\frac{5p^4}{64}+\frac{p^3}{4}-\frac{7p^2}{16}+\frac{p}{6}+ \tau \cdot \left( \frac{p^4}{48}+\frac{3}{16}p^3 + \frac{1}{24}p^2 + 1\right) \\&\quad +i\cdot \left( \frac{p^5}{384}+\frac{3p^4}{64}+\frac{7p^3}{32} +\frac{p^2}{16}-\frac{5p}{12}\right) +j\cdot \left( \frac{p^4}{48}+\frac{3p^3}{16}+\frac{p^2}{24}\right) \\&\quad +ij\cdot \left( \frac{p^4}{96}+\frac{p^3}{8}+\frac{5p^2}{24}\right) + i\tau \cdot \left( \frac{p^4}{96}+\frac{p^3}{8}+\frac{5p^2}{24}\right) . \end{aligned}$$

\(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Delgado, M. On a question of Eliahou and a conjecture of Wilf. Math. Z. 288, 595–627 (2018). https://doi.org/10.1007/s00209-017-1902-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00209-017-1902-3

Keywords

Mathematics Subject Classification

Navigation