The right-generators descendant of a numerical semigroup

2019/11/08 by Bras-Amorós, Maria, Fernández-González, Julio · 1 citation
#Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1911.03173

Abstract

For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an efficient algorithm for exploring the tree up to a given genus. The algorithm exploits the second nonzero element of a numerical semigroup and the particular pseudo-ordinary case in which this element is the conductor.

Cited by

• Algorithms and results on multiparameter counting of numerical semigroups

Related

• Computation of numerical semigroups by means of seeds
• Exploring the tree of numerical semigroups
• Exploring the unleaved tree of numerical semigroups up to a given genus
• Numerical semigroup tree: type-representation
• The tree of irreducible numerical semigroups with fixed Frobenius number