Computation of numerical semigroups by means of seeds
From MaRDI portal
(Redirected from Publication:4640333)
Abstract: For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative efficient way, since the seeds of each descendant can be easily obtained from the seeds of its parent. The paper is devoted to presenting the results which are related to this approach, leading to a new algorithm for computing and counting the semigroups of a given genus.
Recommendations
Cites work
- A Note on Numerical Semigroups
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
- Bounds on the number of numerical semigroups of a given genus
- Constructing numerical semigroups of a given genus.
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- Counting numerical semigroups with short generating functions.
- Degree asymptotics of the numerical semigroup tree.
- 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.
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3101854 (Why is no real title available?)
- Improved bounds on the number of numerical semigroups of a given genus
- Numerical semigroups.
- The minimum distance of codes in an array coming from telescopic semigroups
- The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals.
- The oversemigroups of a numerical semigroup.
- The set of numerical semigroups of a given genus.
- Towards a better understanding of the semigroup tree
Cited in
(19)- Weak asymptotics in the 3-dim Frobenius problem
- The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals.
- The set of numerical semigroups of a given multiplicity and Frobenius number
- Numerical semigroup tree of multiplicities 4 and 5
- Counting numerical semigroups by genus and even gaps
- New Eliahou semigroups and verification of the Wilf conjecture for genus up to 65
- Exploring the tree of numerical semigroups.
- Ordinarization of numerical semigroups.
- Counting numerical semigroups
- Computing denumerants in numerical 3-semigroups
- scientific article; zbMATH DE number 2115748 (Why is no real title available?)
- The right-generators descendant of a numerical semigroup
- Algorithms for generalized numerical semigroups
- Seeds for Generalized Taxicab Numbers
- The complexity of a numerical semigroup
- On the seeds and the great-grandchildren of a numerical semigroup
- Counting the ideals with given genus of a numerical semigroup
- Rarity of the infinite chains in the tree of numerical semigroups
- On the enumeration of the set of saturated numerical semigroups of a given genus.
This page was built for publication: Computation of numerical semigroups by means of seeds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640333)
