Improved bounds on the number of numerical semigroups of a given genus

From MaRDI portal
Publication:964547

DOI10.1016/J.JPAA.2009.12.031zbMATH Open1185.05008arXiv0905.0489OpenAlexW2962769904MaRDI QIDQ964547FDOQ964547


Authors: Sergi Elizalde Edit this on Wikidata


Publication date: 22 April 2010

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use them to construct approximations of T by generating trees whose nodes are labeled by certain parameters of the semigroups. We then translate the succession rules of these trees into functional equations for the generating functions that enumerate their nodes, and solve these equations to obtain the bounds. Some of our bounds involve the Fibonacci numbers, and the others are expressed as generating functions. We also give upper bounds on the number of numerical semigroups having an infinite number of descendants in T.


Full work available at URL: https://arxiv.org/abs/0905.0489




Recommendations



Cites Work


Cited In (25)

Uses Software





This page was built for publication: Improved bounds on the number of numerical semigroups of a given genus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964547)