The forbidden ordering conjecture for omega-values in 3-generated numerical monoids
Statement
Let be a numerical monoid minimally generated by , and let denote the omega-value of . The forbidden ordering conjecture. The following orderings are impossible:
Computations indicate that almost every ordering of the three omega-values occurs for some minimally 3-generated numerical monoid, while these three orderings do not. The claim concerns the remaining obstruction to describing which orderings are possible.
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.