Exploring the tree of numerical semigroups
Combinatorics
2015-09-15 v2
Abstract
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 g 67 and we confirm the Wilf conjecture for g 60.
Cite
@article{arxiv.1305.3831,
title = {Exploring the tree of numerical semigroups},
author = {Jean Fromentin and Florent Hivert},
journal= {arXiv preprint arXiv:1305.3831},
year = {2015}
}
Comments
14 pages