Counting numerical semigroups by genus and some cases of a question of Wilf.
From MaRDI portal
Publication:436083
DOI10.1016/j.jpaa.2011.10.038zbMath1255.20054MaRDI QIDQ436083
Publication date: 30 July 2012
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2011.10.038
multiplicities; genera; Frobenius numbers; embedding dimension; Apéry sets; numbers of numerical semigroups
05A15: Exact enumeration problems, generating functions
20M14: Commutative semigroups
11D07: The Frobenius problem
Related Items
Counting Numerical Semigroups, Parametrizing numerical semigroups with multiplicity up to 5, Computation of numerical semigroups by means of seeds, Wilf's conjecture for numerical semigroups, Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\), On the type of certain numerical semigroups and a question of Wilf., Near-misses in Wilf's conjecture, Position vectors of numerical semigroups, An extension of Wilf's conjecture to affine semigroups, The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals., Fibonacci-like growth of numerical semigroups of a given genus., Numerical semigroups and Kunz polytopes, On a conjecture by Wilf about the Frobenius number, The proportion of Weierstrass semigroups, Counting numerical semigroups by genus and even gaps, Degree asymptotics of the numerical semigroup tree.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Gaps in semigroups
- Improved bounds on the number of numerical semigroups of a given genus
- Constructing numerical semigroups of a given genus.
- Counting numerical sets with no small atoms
- Bounds on the number of numerical semigroups of a given genus
- Numerical semigroups.
- Non-Weierstrass numerical semigroups
- On symmetric numerical semigroups
- Representation of numerical semigroups by Dyck paths.
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Constructions of generalized Sidon sets.
- Towards a better understanding of the semigroup tree
- The Postage Stamp Problem and Essential Subsets in Integer Bases
- COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS
- SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS
- Upper bounds for finite additive $2$-bases
- On the linear diophantine problem of Frobenius.
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- Solving a linear equation in a set of integers I
- On certain n-sheeted coverings of curves and numerical semigroups which cannot be realized as weierstrass semigroups
- Generalized Ehrhart polynomials
