Strong-generator sparsity conjecture for numerical semigroups
Statement
For each genus , let be the number of strong generators and let be the number of weak generators, counted over all numerical semigroups of genus . Strong-generator sparsity conjecture.
This conjecture would support the idea that strong generators become negligible among effective generators, making the semigroup tree increasingly resemble the Fibonacci-generating model. The source presents it as a computationally motivated conjecture and gives no resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.