Timeline for Verifying the correctness of a Sudoku solution
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 17, 2013 at 10:06 | comment | added | Ralph | @François: You managed to algebraicify the problem. Great. Thanks. | |
| May 4, 2013 at 18:02 | comment | added | François Brunault | @Sam : Good question, I don't know the answer. In fact, I should say that all the difficult work here is contained in Emil's answer. In particular we need $\models$ = $\vdash$ (his Proposition 2) in order to prove the matroid property, and this is done by a case-by-case analysis, so it is not clear what happens for higher values of $n$. | |
| May 4, 2013 at 6:37 | comment | added | Tony Huynh | Just for reference, I asked this as a separate question mathoverflow.net/questions/129600/is-there-a-sudoku-matroid | |
| May 4, 2013 at 5:01 | comment | added | Sam Hopkins | Does the matroid property easily generalize to $n \times n$-Sudoku? | |
| May 4, 2013 at 2:09 | history | answered | François Brunault | CC BY-SA 3.0 |