Degree asymptotics of the numerical semigroup tree.

DOI10.1007/s00233-013-9486-7zbMath1319.20050OpenAlexW2079513712MaRDI QIDQ2447250

Evan O'Dorney

Publication date: 25 April 2014

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-013-9486-7

zbMATH Keywords

Frobenius numbersefficacyminimal generatorsnumbers of numerical semigroupstrees of numerical semigroupsgenus of numerical semigroupsstrongly descended semigroups

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Asymptotic results on counting functions for algebraic and topological structures (11N45) Asymptotic enumeration (05A16) The Frobenius problem (11D07)

Related Items (6)

Numerical semigroups, polyhedra, and posets I: the group cone ⋮ Counting numerical semigroups by genus and even gaps ⋮ Counting Numerical Semigroups ⋮ Sub-Fibonacci behavior in numerical semigroup enumeration ⋮ Computation of numerical semigroups by means of seeds ⋮ Numerical semigroups of small and large type

Cites Work

• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Constructing numerical semigroups of a given genus.
• Numerical semigroups.
• Fibonacci-like growth of numerical semigroups of a given genus.
• The proportion of Weierstrass semigroups
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Towards a better understanding of the semigroup tree

This page was built for publication: Degree asymptotics of the numerical semigroup tree.