Modulo-4 conjecture for near-perfect matchings of odd rectangles
Statement
Let and be odd positive integers, let denote the number of near-perfect matchings of the grid with a specified hole , and let be an even white hole.
Modulo- conjecture. Except sometimes when and are both congruent to modulo , the count is a multiple of .
The paper presents this as an example conjecture motivated by parity and modulo- arguments, but does not specify the exceptional cases or resolve the claim.
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.