The right-generators descendant of a numerical semigroup

DOI10.1090/MCOM/3502zbMATH Open1477.20114arXiv1911.03173OpenAlexW2990491943WikidataQ126768465 ScholiaQ126768465MaRDI QIDQ4960084FDOQ4960084

Authors: Maria Bras-Amorós, Julio Fernández-González 

Publication date: 8 April 2020

Published in: Mathematics of Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1911.03173

Recommendations

• Computation of numerical semigroups by means of seeds
• On the enumeration of the set of saturated numerical semigroups of a given genus.
• Exploring the tree of numerical semigroups.
• Fibonacci-like growth of numerical semigroups of a given genus.
• The set of numerical semigroups of a given genus.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05)

Cites Work

• Title not available (Why is that?)
• Exploring the tree of numerical semigroups.
• Bounds on the number of numerical semigroups of a given genus
• Fibonacci-like growth of numerical semigroups of a given genus.
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Towards a better understanding of the semigroup tree
• Fundamental gaps in numerical semigroups.
• Gapsets and numerical semigroups
• The oversemigroups of a numerical semigroup.
• Computation of numerical semigroups by means of seeds
• Counting numerical semigroups

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
• On the seeds and the great-grandchildren of a numerical semigroup
• RGD-algorithm
• The set of numerical semigroups of a given multiplicity and Frobenius number

Uses Software

• NumericalSemigroupsWithGenus
• OEIS
• Cilk
• nsgtree
• combos
• NumericMonoid
• GitHub

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)