Bounds on the Number of Numerical Semigroups of a Given Genus

Simple item page
dc.creatorBras-Amoros, Maria
dc.date2008-02-15
dc.date.accessioned2026-07-07T09:21:11Z
dc.date.available2026-07-07T09:21:11Z
dc.descriptionCombinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical semigroups of genus $g$ satisfies $2F_{g}\leq n_g\leq 1+3\cdot 2^{g-3}$, where $F_g$ denotes the $g$th Fibonacci number.
dc.identifierhttps://arxiv.org/abs/0802.2175
dc.identifierhttp://arxiv.org/abs/0802.2175
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154936
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subjectG.2.1
dc.titleBounds on the Number of Numerical Semigroups of a Given Genus
dc.typetext

Files

Collections

arXiv