Exploring the tree of numerical semigroups
DOI10.1090/mcom/3075zbMath1344.20075arXiv1305.3831OpenAlexW1821669609MaRDI QIDQ2814451
Jean Fromentin, Florent Hivert
Publication date: 22 June 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.3831
algorithmsFrobenius numbersnumbers of numerical semigroupstrees of numerical semigroupsgenus of numerical semigroups
Symbolic computation and algebraic computation (68W30) Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Commutative semigroups (20M14) Software, source code, etc. for problems pertaining to group theory (20-04) The Frobenius problem (11D07)
Related Items (26)
Uses Software
Cites Work
- Numerical semigroups.
- Fibonacci-like growth of numerical semigroups of a given genus.
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Fundamental gaps of numerical semigroups generated by two elements.
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- numericalsgps, a GAP package for numerical semigroups
- Generating tuples of integers modulo the action of a permutation group and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exploring the tree of numerical semigroups