Counting numerical semigroups with short generating functions.
From MaRDI portal
Abstract: This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting the number of these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.
Recommendations
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- scientific article; zbMATH DE number 7637229
- On the enumeration of the set of numerical semigroups with fixed Frobenius number.
- The set of numerical semigroups of a given genus.
- The Frobenius problem for numerical semigroups
Cites work
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Bounds on the number of numerical semigroups of a given genus
- Constructing numerical semigroups of a given genus.
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Counting with rational generating functions
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Fundamental gaps in numerical semigroups.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved bounds on the number of numerical semigroups of a given genus
- Non-Weierstrass numerical semigroups
- Numerical semigroups with multiplicity three and four.
- Numerical semigroups.
- On Counting Integral Points in a Convex Rational Polytope
- Parametric integer programming algorithm for bilevel mixed integer programs
- Short rational functions for toric algebra and applications
- Short rational generating functions for lattice point problems
- SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS
- The Frobenius problem for numerical semigroups
- Towards a better understanding of the semigroup tree
Cited in
(32)- Random numerical semigroups and a simplicial complex of irreducible semigroups
- The set of numerical semigroups of a given genus.
- The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals.
- An improved algorithm to compute the -primality
- Numerical semigroups and Kunz polytopes
- Dense numerical semigroups
- Square-free divisor complexes of certain numerical semigroup elements
- The set of numerical semigroups of a given multiplicity and Frobenius number
- Geometrical illustration of numerical semigroups and of some of their invariants.
- Integral points in rational polygons: a numerical semigroup approach
- Counting numerical semigroups by genus and even gaps
- Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
- COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
- Irreducible numerical semigroups with multiplicity three and four.
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- Counting numerical semigroups
- Parametrizing Arf numerical semigroups
- Parametrizing numerical semigroups with multiplicity up to 5
- Computation of numerical semigroups by means of seeds
- Subsemigroup, ideal and congruence growth of free semigroups
- scientific article; zbMATH DE number 7637229 (Why is no real title available?)
- Counting Numerical Semigroups by Genus and Even Gaps via Kunz-Coordinate Vectors
- On parametrized families of numerical semigroups
- A sequence of quasipolynomials arising from random numerical semigroups
- BOUNDS FOR THE GENUS OF NUMERICAL SEMIGROUPS
- Quasi-polynomial growth of numerical and affine semigroups with constrained gaps
- Counting the ideals with given genus of a numerical semigroup
- On integer partitions corresponding to numerical semigroups
- Counting numerical semigroups by Frobenius number, multiplicity, and depth
- Generating functions for the quotients of numerical semigroups
- Certified algorithms for numerical semigroups in Rocq
- On the number of numerical semigroups containing two coprime integers p and q.
This page was built for publication: Counting numerical semigroups with short generating functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112587)
