Exploring the tree of numerical semigroups
Résumé
In this paper we describe an algorithm visiting all numerical semigroups
up to a given genus using a new 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 $g\leq 67$ and we confirm the Wilf conjecture for $g\leq 60$.
Domaines
Combinatoire [math.CO]
Origine : Fichiers produits par l'(les) auteur(s)