The right-generators descendant of a numerical semigroup
From MaRDI portal
Publication:4960084
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Bounds on the number of numerical semigroups of a given genus
- Computation of numerical semigroups by means of seeds
- Counting numerical semigroups
- Exploring the tree of numerical semigroups.
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Fibonacci-like growth of numerical semigroups of a given genus.
- Fundamental gaps in numerical semigroups.
- Gapsets and numerical semigroups
- The oversemigroups of a numerical semigroup.
- Towards a better understanding of the semigroup tree
Cited in
(7)- Exploring the tree of numerical semigroups.
- An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup.
- Computation of numerical semigroups by means of seeds
- Sub-Fibonacci behavior in numerical semigroup enumeration
- RGD-algorithm
- On the seeds and the great-grandchildren of a numerical semigroup
- The set of numerical semigroups of a given multiplicity and Frobenius number
Describes a project that uses
Uses Software
This page was built for publication: The right-generators descendant of a numerical semigroup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960084)
