Timeline for Gröbner basis for Sudoku
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 15, 2018 at 13:01 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor improvements
|
| Mar 15, 2018 at 11:59 | review | Suggested edits | |||
| S Mar 15, 2018 at 13:01 | |||||
| Jun 24, 2012 at 22:23 | answer | added | Markus Schweighofer | timeline score: 11 | |
| Mar 20, 2012 at 1:33 | comment | added | Ralph | Can't a sudoku be represented more easily as a system of linear equations ? | |
| Mar 19, 2012 at 23:27 | comment | added | Jacques Carette | @Henry: Maple uses F4 as implemented by Faugère himself, so assuming the GB problem is posed properly, it should make not difference if Maple or Magma is used. The proposal to use a finite field is probably a much better idea. | |
| Mar 19, 2012 at 21:36 | comment | added | Ingdas | I suppose implementation of Buchberger or analog algorithms are faster in Maple than in an implementation that I write myself. I am looking for a trick (odering of my arguments, some simple modification of the polynomials, ...?) which makes everything feasible in Maple or Singular. | |
| Mar 19, 2012 at 21:27 | comment | added | Will Jagy | also posted math.stackexchange.com/questions/121387/… | |
| Mar 19, 2012 at 21:16 | comment | added | Henry Cohn | You might try using Magma, which has a really great implementation of the Faugère F4 algorithm in its Gröbner basis routines (much better than any other system I've used, although I can't claim to be an expert). Zeb's comment about finite fields is also important: Gröbner bases over the rationals can have extremely complicated coefficients, which should be avoided when possible. | |
| Mar 19, 2012 at 21:10 | comment | added | zeb | Just a thought - maybe you should try doing the calculations over a finite field with 9 elements? That would probably make the coefficients occurring in your polynomials much easier to store. (For instance, the polynomial F_i simply becomes x_i^9-x_i.) | |
| Mar 19, 2012 at 20:58 | comment | added | Sean Eberhard | Are you just looking for something like Buchberger's algorithm? en.wikipedia.org/wiki/Buchberger%27s_algorithm | |
| Mar 19, 2012 at 20:44 | history | asked | Ingdas | CC BY-SA 3.0 |