Fibonacci-like behavior of the number of numerical semigroups of a given genus.
From MaRDI portal
Publication:2481324
Abstract: We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the number of semigroups of genus at most 50. The Wilf conjecture has also been checked for all numerical semigroups with genus in the same range.
Recommendations
Cites work
- scientific article; zbMATH DE number 3101854 (Why is no real title available?)
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- Apery Sets of Numerical Semigroups#
- Numerical Semigroups with a Monotonic Apery Set
- On a question of Wilf concerning numerical semigroups
- On numerical semigroups
- SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS
- The On-Line Encyclopedia of Integer Sequences
Cited in
(60)- On the seeds and the great-grandchildren of a numerical semigroup
- Counting numerical semigroups by Frobenius number, multiplicity, and depth
- The extended Frobenius problem for Fibonacci sequences incremented by a Fibonacci number
- Sub-Fibonacci behavior in numerical semigroup enumeration
- Reflective numerical semigroups
- The expected embedding dimension, type and weight of a numerical semigroup
- Quasi-polynomial growth of numerical and affine semigroups with constrained gaps
- A verification of Wilf's conjecture up to genus \(100\)
- Counting numerical semigroups
- The proportion of Weierstrass semigroups
- Gapsets and numerical semigroups
- 2-generated semigroup of automatic transformations whose growth is defined by Fibonacci series.
- Numerical semigroups with large embedding dimension satisfy Wilf's conjecture.
- On pure \(\kappa\)-sparse gapsets
- Bounds on the number of numerical semigroups of a given genus
- Numerical semigroups and Kunz polytopes
- On a question of Eliahou and a conjecture of Wilf
- Computation of numerical semigroups by means of seeds
- Algorithms for generalized numerical semigroups
- A generalization of a theorem about gapsets with depth at most 3
- Improved bounds on the number of numerical semigroups of a given genus
- Counting numerical semigroups by genus and even gaps
- Frobenius R-variety of the numerical semigroups contained in a given one
- The set of numerical semigroups of a given genus.
- Counting Numerical Semigroups by Genus and Even Gaps via Kunz-Coordinate Vectors
- Constructing numerical semigroups of a given genus.
- Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
- Counting numerical semigroups with short generating functions.
- Increasingly enumerable submonoids of \(\mathbb{R}\): music theory as a unifying theme
- On a special case of Wilf’s conjecture
- Fibonacci-like growth of numerical semigroups of a given genus.
- Wilf's conjecture for numerical semigroups
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- On two-generator Fibonacci numerical semigroups with a prescribed genus
- Almost symmetric numerical semigroups with high type
- Counting the ideals with given genus of a numerical semigroup
- Distribution of genus among numerical semigroups with fixed Frobenius number
- On the number of numerical semigroups \(\langle a,b\rangle\) of prime power genus.
- Near-misses in Wilf's conjecture
- Gapsets of Small Multiplicity
- scientific article; zbMATH DE number 7637229 (Why is no real title available?)
- On the type of certain numerical semigroups and a question of Wilf.
- Frobenius Numbers of Generalized Fibonacci Semigroups
- Exploring the tree of numerical semigroups.
- Conjecture of Wilf: A Survey
- Degree asymptotics of the numerical semigroup tree.
- Almost symmetric numerical semigroups with given Frobenius number and type
- Numerical semigroups, polyhedra, and posets. I: The group cone
- Subsemigroup, ideal and congruence growth of free semigroups
- The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals.
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
- Numerical semigroup tree of multiplicities 4 and 5
- The tree of good semigroups in \(\mathbb{N}^2\) and a generalization of the Wilf conjecture
- The set of numerical semigroups of a given multiplicity and Frobenius number
- Numerical semigroups generated by primes
- An extension of Wilf's conjecture to affine semigroups
- A graph-theoretic approach to Wilf's conjecture
- The right-generators descendant of a numerical semigroup
- Towards a better understanding of the semigroup tree
- On a conjecture by Wilf about the Frobenius number
This page was built for publication: Fibonacci-like behavior of the number 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 Q2481324)