Exploring the tree of numerical semigroups
Exploring the tree of numerical semigroups
复制标题
探索数值半群树
作者：
J. Fromentin;F. Hivert
在本文中，我们描述了一个算法访问所有的数值半群，直到一个给定的亏格使用一个很好的适合的表示。该算法的兴趣是，它特别适合现代计算机的架构，允许非常大的优化：我们获得的数字半群的属g 67，我们确认了G 60的Wilf猜想。
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.