ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N=(an−1( ⁣ ⁣ ⁣ ⁣ ⁣ ⁣ ⁣ ⁣ ⁣ ⁣1)⋯a0)gN=(a_{n-1}\binom{\!\!\!\!\!\!\!\!\!\!}{\vphantom{1}}\cdots a_0)_g be a (g,k)(g,k)-reverse multiple, with endpoint digits a0a_0 and an−1a_{n-1}, and let its associated graph be the Young graph. The 1089 graph is the Young graph isomorphic to the (10,4)(10,4) and (10,9)(10,9) Young graphs.

1089 graph endpoint conjecture. If there is a (g,k)(g,k)-reverse multiple with a0+an−1=ga_0+a_{n-1}=g, then the Young graph is the 1089 graph. Conversely, if the graph is the 1089 graph, then every reverse multiple satisfies a0+an−1=ga_0+a_{n-1}=g.

The first implication is suggested by the preceding theorem together with the 1089 graph conjecture, while the converse is also expected to follow from that conjecture. The claim is stated separately because it may have an independent proof and is used later in the paper.

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.