Exploring the tree of numerical semigroups In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well-suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing very large optimizations: we obtain the number of numerical semigroups of genus $gleq 67$ and we confirm the Wilf conjecture for $gleq 60$.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Delgado, Manuel: On a question of Eliahou and a conjecture of Wilf (2018)
- Bernardini, Matheus; Torres, Fernando: Counting numerical semigroups by genus and even gaps (2017)
- Fromentin, Jean; Hivert, Florent: Exploring the tree of numerical semigroups. (2016)