Fibonacci-like growth of numerical semigroups of a given genus.
DOI10.1007/s00233-012-9456-5zbMath1276.20066arXiv1111.3142OpenAlexW1999043701MaRDI QIDQ1955596
Publication date: 14 June 2013
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3142
Frobenius numbersminimal generatorsnumbers of numerical semigroupstrees of numerical semigroupseffective generatorsefficiency of numerical semigroupsgenus of numerical semigroupsstrongly descended semigroups
Trees (05C05) Exact enumeration problems, generating functions (05A15) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Asymptotic enumeration (05A16) The Frobenius problem (11D07)
Related Items (39)
Cites Work
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- Constructing numerical semigroups of a given genus.
- Numerical semigroups.
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Recognizable formal series on trees and cofree coalgebraic systems
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Towards a better understanding of the semigroup tree
- An Application of Integer Programming to the Decomposition of Numerical Semigroups
This page was built for publication: Fibonacci-like growth of numerical semigroups of a given genus.