Indexed metadata
Exploring the tree of numerical semigroups
Jean Fromentin, Florent Hivert
Source 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 g\leqslant 67 and we confirm the Wilf conjecture for g ⩽ 60 g\leqslant 60 .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.