Improved bounds on the number of numerical semigroups of a given genus
From MaRDI portal
Publication:964547
DOI10.1016/j.jpaa.2009.12.031zbMath1185.05008arXiv0905.0489OpenAlexW2962769904MaRDI QIDQ964547
Publication date: 22 April 2010
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.0489
Trees (05C05) Exact enumeration problems, generating functions (05A15) Commutative semigroups (20M14) Asymptotic results on counting functions for algebraic and topological structures (11N45) Asymptotic enumeration (05A16)
Related Items
Frobenius R-variety of the numerical semigroups contained in a given one, Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\), Towards a better understanding of the semigroup tree, Counting numerical semigroups by genus and even gaps, Counting Numerical Semigroups, Quasi-polynomial growth of numerical and affine semigroups with constrained gaps, The set of numerical semigroups of a given genus., The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals., Counting the ideals with given genus of a numerical semigroup, Counting numerical semigroups by genus and some cases of a question of Wilf., Reductions for vector \((n,m)\)-presentations of \((n,m)\)-semigroups., Computation of numerical semigroups by means of seeds, Subsemigroup, ideal and congruence growth of free semigroups, Unnamed Item, Numerical semigroups and Kunz polytopes, Constructing numerical semigroups of a given genus., On two-generator Fibonacci numerical semigroups with a prescribed genus, COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS
Uses Software
Cites Work
