ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a(2k+1)a(2k+1) be the total number of near-perfect matchings of the (2k+1)×(2k+1)(2k+1)\times(2k+1) grid, and write

a(2k+1)=2kck.a(2k+1)=2^k c_k.

Kong's modulo-88 conjecture. For all kk, the integer ckc_k is congruent to 11 modulo 88.

This is presented as a further conjecture of Kong after the paper proves only that ckc_k is odd; its status is not resolved in the supplied text.

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.