The 1089 graph characterization by endpoint digits
Statement
Let be a -reverse multiple, with endpoint digits and , and let its associated graph be the Young graph. The 1089 graph is the Young graph isomorphic to the and Young graphs.
1089 graph endpoint conjecture. If there is a -reverse multiple with , then the Young graph is the 1089 graph. Conversely, if the graph is the 1089 graph, then every reverse multiple satisfies .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.