Bounds for invariants of numerical semigroups and Wilf’s conjecture
Open Access
- 31 May 2023
- journal article
- research article
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 304 (2) , 1-5
Abstract
Given coprime positive integers $$g_1< \ldots < g_e$$ , the Frobenius number $$F=F(g_1,\ldots ,g_e)$$ is the largest integer not representable as a linear combination of $$g_1,\ldots ,g_e$$ with non-negative integer coefficients. Let n denote the number of all representable non-negative integers less than F; Wilf conjectured that $$F+1 \le e n$$ . We provide bounds for $$g_1$$ and for the type of the numerical semigroup $$S=\langle g_1,\ldots ,g_e \rangle $$ in function of e and n, and use these bounds to prove that $$F+1 \le q e n$$ , where $$q= \Bigg \lceil \frac{F+1}{g_1} \Bigg \rceil $$ , and $$F+1 \le e n^2$$ . Finally, we give an alternative, simpler proof for the Wilf conjecture if the numerical semigroup $$S=\langle g_1,\ldots ,g_e \rangle $$ is almost-symmetric.
Keywords
All Related Versions
Funding Information
- Università degli Studi di Catania
This publication has 9 references indexed in Scilit:
- New Eliahou Semigroups and Verification of the Wilf Conjecture for Genus up to 652021
- A Graph-Theoretic Approach to Wilf's ConjectureThe Electronic Journal of Combinatorics, 2020
- Wilf’s conjecture and Macaulay’s theoremJournal of the European Mathematical Society, 2018
- On a conjecture by Wilf about the Frobenius numberMathematische Zeitschrift, 2015
- On propinquity of numerical semigroups and one-dimensional local Cohen Macaulay rings2009
- Numerical Semigroups2009
- The Diophantine Frobenius Problem2005
- On formulas for the Frobenius number of a numerical semigroup.MATHEMATICA SCANDINAVICA, 1990
- On numerical semigroupsSemigroup Forum, 1986