The set of numerical semigroups of a given genus
Preprint
Abstract
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence relation is given over this set and a tree structure is defined for each equivalence class. We also provide a more efficient algorithm based in the translation of a numerical semigroup to its so-called Kunz-coordinates vector.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Counting numerical semigroups by genus and some cases of a question of WilfJournal of Pure and Applied Algebra, 2012
- The tree of irreducible numerical semigroups with fixed Frobenius numberForum Mathematicum, 2011
- Improved bounds on the number of numerical semigroups of a given genusJournal of Pure and Applied Algebra, 2010
- Constructing numerical semigroups of a given genusSemigroup Forum, 2009
- Bounds on the number of numerical semigroups of a given genusJournal of Pure and Applied Algebra, 2009
- Fibonacci-like behavior of the number of numerical semigroups of a given genusSemigroup Forum, 2007
- Numerical semigroups that can be expressed as an intersection of symmetric numerical semigroups Communicated by M.-F. RoyJournal of Pure and Applied Algebra, 2002
- Systems of Inequalities and Numerical SemigroupsJournal of the London Mathematical Society, 2002
- Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domainsMemoirs of the American Mathematical Society, 1997
- On the linear diophantine problem of Frobenius.Journal für die reine und angewandte Mathematik (Crelles Journal), 1977