Improved bounds on the number of numerical semigroups of a given genus
From MaRDI portal
(Redirected from Publication:964547)
Abstract: We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use them to construct approximations of T by generating trees whose nodes are labeled by certain parameters of the semigroups. We then translate the succession rules of these trees into functional equations for the generating functions that enumerate their nodes, and solve these equations to obtain the bounds. Some of our bounds involve the Fibonacci numbers, and the others are expressed as generating functions. We also give upper bounds on the number of numerical semigroups having an infinite number of descendants in T.
Recommendations
- Bounds on the number of numerical semigroups of a given genus
- BOUNDS FOR THE GENUS OF NUMERICAL SEMIGROUPS
- On numerical semigroups with almost-maximal genus
- Counting numerical semigroups by genus and even gaps
- On the number of numerical semigroups a,b of prime power genus.
- On the enumeration of the set of saturated numerical semigroups of a given genus.
- On the genus of a quotient of a numerical semigroup
- Counting Numerical Semigroups by Genus and Even Gaps via Kunz-Coordinate Vectors
- The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus
- Distribution of genus among numerical semigroups with fixed Frobenius number
Cites work
Cited in
(26)- scientific article; zbMATH DE number 7637229 (Why is no real title available?)
- Numerical semigroups and Kunz polytopes
- Frobenius R-variety of the numerical semigroups contained in a given one
- Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- On two-generator Fibonacci numerical semigroups with a prescribed genus
- BOUNDS FOR THE GENUS OF NUMERICAL SEMIGROUPS
- Computation of numerical semigroups by means of seeds
- Quasi-polynomial growth of numerical and affine semigroups with constrained gaps
- Degree asymptotics of the numerical semigroup tree.
- Bounds on the number of numerical semigroups of a given genus
- Constructing numerical semigroups of a given genus.
- Counting numerical semigroups by genus and even gaps
- On the genus of a quotient of a numerical semigroup
- Counting the ideals with given genus of a numerical semigroup
- Gapsets and numerical semigroups
- Counting numerical semigroups with short generating functions.
- The set of numerical semigroups of a given genus.
- Different tree approaches to the problem of counting numerical semigroups by genus
- The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals.
- Towards a better understanding of the semigroup tree
- Reductions for vector \((n,m)\)-presentations of \((n,m)\)-semigroups.
- Subsemigroup, ideal and congruence growth of free semigroups
- Distribution of genus among numerical semigroups with fixed Frobenius number
- Counting Numerical Semigroups by Genus and Even Gaps via Kunz-Coordinate Vectors
- Counting numerical semigroups
This page was built for publication: Improved bounds on the number of numerical semigroups of a given genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964547)
