ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a Young graph be the graph associated with the (g,k)(g,k)-reverse multiples, whose node labels have the form [r′,r][r',r]. A node is nonzero diagonal-labelled when its label is [r,r][r,r] with r≠0r\ne0.

Complete Young graph conjecture. A Young graph is a complete graph if and only if it has at least one nonzero diagonal-labelled node [r,r][r,r].

This is a stronger statement than the preceding theorem, which proves only that a Young graph is complete when every node label has the form [r,r][r,r]. The conjecture is consistent with all the data reported in the paper, but remains open.

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.