Computing the number of numerical semigroups using generating functions
Combinatorics
2009-12-23 v3 Commutative Algebra
Abstract
This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting the number of these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.
Keywords
Cite
@article{arxiv.0901.1228,
title = {Computing the number of numerical semigroups using generating functions},
author = {Victor Blanco and Pedro A. Garcia-Sanchez and Justo Puerto},
journal= {arXiv preprint arXiv:0901.1228},
year = {2009}
}
Comments
14 pages, 1 figure