ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ=⟨n1,n2,n3⟩\Gamma = \langle n_1,n_2,n_3\rangle be a numerical monoid minimally generated by n1<n2<n3n_1<n_2<n_3, and let ω(ni)\omega(n_i) denote the omega-value of nin_i. The forbidden ordering conjecture. The following orderings are impossible:

ω(n1)>ω(n2)>ω(n3),ω(n1)=ω(n2)>ω(n3),ω(n3)<ω(n1)<ω(n2).\omega(n_1)>\omega(n_2)>\omega(n_3),\qquad \omega(n_1)=\omega(n_2)>\omega(n_3),\qquad \omega(n_3)<\omega(n_1)<\omega(n_2).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.