Fibonacci-like growth of numerical semigroups of a given genus.

DOI10.1007/S00233-012-9456-5zbMATH Open1276.20066arXiv1111.3142OpenAlexW1999043701MaRDI QIDQ1955596FDOQ1955596

Authors: Alex Zhai 

Publication date: 14 June 2013

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

Abstract: We give an asymptotic estimate of the number of numerical semigroups of a given genus. In particular, if $n_g$ is the number of numerical semigroups of genus $g$, we prove that $n_g$ tends to $Sph{i}^g$, where $phi$ is the golden ratio, and $S$ is a constant, resolving several related conjectures concerning the growth of $n_g$. In addition, we show that the proportion of numerical semigroups of genus $g$ satisfying $f<3m$ approaches 1 as $gightarrowinfty$, where $m$ is the multiplicity and $f$ is the Frobenius number.

Full work available at URL: https://arxiv.org/abs/1111.3142

Recommendations

• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Constructing numerical semigroups of a given genus.
• Gapsets and numerical semigroups
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Counting numerical semigroups

zbMATH Keywords

Frobenius numbersminimal generatorsnumbers of numerical semigroupstrees of numerical semigroupseffective generatorsefficiency of numerical semigroupsgenus of numerical semigroupsstrongly descended semigroups

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) The Frobenius problem (11D07)

Cites Work

• Numerical semigroups.
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Towards a better understanding of the semigroup tree
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Constructing numerical semigroups of a given genus.
• An application of integer programming to the decomposition of numerical semigroups
• Recognizable formal series on trees and cofree coalgebraic systems

Cited In (51)

• The expected embedding dimension, type and weight of a numerical semigroup
• A verification of Wilf's conjecture up to genus \(100\)
• On nonprimitive Weierstrass points
• Gapsets of Small Multiplicity
• Numerical semigroups generated by primes
• 2-generated semigroup of automatic transformations whose growth is defined by Fibonacci series.
• On a question of Eliahou and a conjecture of Wilf
• Numerical semigroups and Kunz polytopes
• Frobenius R-variety of the numerical semigroups contained in a given one
• Exploring the tree of numerical semigroups.
• Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
• Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
• The tree of good semigroups in \(\mathbb{N}^2\) and a generalization of the Wilf conjecture
• Star operations on numerical semigroups: antichains and explicit results
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• On two-generator Fibonacci numerical semigroups with a prescribed genus
• On the enumeration of the set of saturated numerical semigroups of a given genus.
• Quasi-polynomial growth of numerical and affine semigroups with constrained gaps
• Computation of numerical semigroups by means of seeds
• 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.
• Dimension counts for cuspidal rational curves via semigroups
• An extension of Wilf's conjecture to affine semigroups
• On pure \(\kappa\)-sparse gapsets
• Counting numerical semigroups by genus and even gaps
• Counting the ideals with given genus of a numerical semigroup
• Sub-Fibonacci behavior in numerical semigroup enumeration
• Counting numerical sets with no small atoms
• Increasingly enumerable submonoids of \(\mathbb{R}\): music theory as a unifying theme
• The proportion of Weierstrass semigroups
• Gapsets and numerical semigroups
• Two-generator numerical semigroups and Fermat and Mersenne numbers
• Conjecture of Wilf: A Survey
• The right-generators descendant of a numerical semigroup
• Frobenius Numbers of Generalized Fibonacci Semigroups
• The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals.
• Counting numerical semigroups by Frobenius number, multiplicity, and depth
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Algorithms for generalized numerical semigroups
• Towards a better understanding of the semigroup tree
• Numerical semigroups, polyhedra, and posets. I: The group cone
• Distribution of genus among numerical semigroups with fixed Frobenius number
• Subsemigroup, ideal and congruence growth of free semigroups
• The number of star operations on numerical semigroups and on related integral domains
• Counting Numerical Semigroups by Genus and Even Gaps via Kunz-Coordinate Vectors
• Numerical semigroup tree of multiplicities 4 and 5
• Near-misses in Wilf's conjecture
• Counting numerical semigroups
• A generalization of a theorem about gapsets with depth at most 3
• Elasticity in Apéry sets

This page was built for publication: Fibonacci-like growth 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 Q1955596)