Kpotenttalkfinalwebsite

K-Potent Grbner bases and Sudoku
Lacey Johnson James Madison University
Student Research Presentations - James Madison University July 25th, 2013
Lacey Johnson (JMU)
July 25th, 2013
1 / 27
What is a Grbner basis?

A Grbner basis for a system of polynomials is a new system of polynomials, with the same solutions as the original set, but which is easier to solve.
Lacey Johnson (JMU)
July 25th, 2013
2 / 27

A Grbner basis for a system of polynomials is a new system of polynomials, with the same solutions as the original set, but which is easier to solve. Additional "nice" properties: Easier to solve Provides more information about the solutions to the original set of polynomials "Better basis" for the polynomial ideal
Lacey Johnson (JMU)
July 25th, 2013
2 / 27
Buchbergers Algorithm
The algorithm that computes Grbner bases is known as Buchbergers algorithm.
Lacey Johnson (JMU)
July 25th, 2013
3 / 27
The algorithm that computes Grbner bases is known as Buchbergers algorithm. You are already familiar with two common examples of Grbner bases that utilize Buchbergers algorithm.
Lacey Johnson (JMU)
July 25th, 2013
3 / 27
The algorithm that computes Grbner bases is known as Buchbergers algorithm. You are already familiar with two common examples of Grbner bases that utilize Buchbergers algorithm. Two examples: Gauss-Jordan Elimination Greatest Common Divisor
Lacey Johnson (JMU)
July 25th, 2013
3 / 27
Gauss-Jordan Elimination
Let f1 = 0, . . . fs = 0 be a system of linear polynomials. Using Gauss-Jordan Elimination we can reduce the polynomials and transform our original system, f1 = 0, . . . fs = 0, to a new system g1 = 0, . . . gt = 0.
Lacey Johnson (JMU)
July 25th, 2013
4 / 27
Let f1 = 0, . . . fs = 0 be a system of linear polynomials. Using Gauss-Jordan Elimination we can reduce the polynomials and transform our original system, f1 = 0, . . . fs = 0, to a new system g1 = 0, . . . gt = 0. The new system of polynomials in echelon form has the same solution set as the original system. This new system is also easier to solve and gives additional information about the number of solutions - one, innitely many, or no solutions.
Lacey Johnson (JMU)
July 25th, 2013
4 / 27
Let f1 = 0, . . . fs = 0 be a system of linear polynomials. Using Gauss-Jordan Elimination we can reduce the polynomials and transform our original system, f1 = 0, . . . fs = 0, to a new system g1 = 0, . . . gt = 0. The new system of polynomials in echelon form has the same solution set as the original system. This new system is also easier to solve and gives additional information about the number of solutions - one, innitely many, or no solutions. The resulting set of polynomials, {g1 , . . . gt }, is a Grbner basis for the original ideal, I := f1 , . . . , fs .
Lacey Johnson (JMU)
July 25th, 2013
4 / 27
Greatest Common Divisor

Let f1 = 0, . . . , fs = 0 be a system of polynomials in one variable. This system has a greatest common divisor, g = 0, whose solution set is the same as the original system f1 = 0, . . . , fs = 0. So, {g } is a Grbner basis for the ideal of polynomials I = f1 , . . . , fs .
Lacey Johnson (JMU)
July 25th, 2013
5 / 27

Let f1 = 0, . . . , fs = 0 be a system of polynomials in one variable. This system has a greatest common divisor, g = 0, whose solution set is the same as the original system f1 = 0, . . . , fs = 0. So, {g } is a Grbner basis for the ideal of polynomials I = f1 , . . . , fs . The greatest common divisor can be computed using the Euclidean algorithm which follows Buchbergers algorithm.
Lacey Johnson (JMU)
July 25th, 2013
5 / 27

Let f1 = 0, . . . , fs = 0 be a system of polynomials in one variable. This system has a greatest common divisor, g = 0, whose solution set is the same as the original system f1 = 0, . . . , fs = 0. So, {g } is a Grbner basis for the ideal of polynomials I = f1 , . . . , fs . The greatest common divisor can be computed using the Euclidean algorithm which follows Buchbergers algorithm. Both Gauss-Jordan Elimination and the Euclidean algorithm are two examples of Buchbergers algorithm for computing Grbner bases.
Lacey Johnson (JMU)
July 25th, 2013
5 / 27

Let f1 = 0, . . . , fs = 0 be a system of polynomials in one variable. This system has a greatest common divisor, g = 0, whose solution set is the same as the original system f1 = 0, . . . , fs = 0. So, {g } is a Grbner basis for the ideal of polynomials I = f1 , . . . , fs . The greatest common divisor can be computed using the Euclidean algorithm which follows Buchbergers algorithm. Both Gauss-Jordan Elimination and the Euclidean algorithm are two examples of Buchbergers algorithm for computing Grbner bases. Buchbergers algorithm computes a Grbner basis for polynomials in many variables in any degree.
Lacey Johnson (JMU)
July 25th, 2013
5 / 27
Problems with Buchbergers Algorithm

While utilizing Buchbergers algorithm, many intermediate polynomials are computed and discarded before the nal Grbner basis is reached.
Lacey Johnson (JMU)
July 25th, 2013
6 / 27

While utilizing Buchbergers algorithm, many intermediate polynomials are computed and discarded before the nal Grbner basis is reached. The coefcients and degrees of these intermediate polynomials can grow to an enormous size. These problems are known as coefcient explosion and degree growth.
Lacey Johnson (JMU)
July 25th, 2013
6 / 27

While utilizing Buchbergers algorithm, many intermediate polynomials are computed and discarded before the nal Grbner basis is reached. The coefcients and degrees of these intermediate polynomials can grow to an enormous size. These problems are known as coefcient explosion and degree growth.
Both of these issues can very quickly overload the computers memory, slow down and even stop the computation altogether.
Lacey Johnson (JMU)
July 25th, 2013
6 / 27
Sudoku and Shidoku

Most of you are familiar with Sudoku, played on a 9x9 grid. For the purpose of illustration, it will be convenient for us to work with a simpler version of Sudoku called Shidoku. A Shidoku board is a 4 4 Latin square whose regions (rows, columns, and designated 2 2 blocks) each contain the integers 14 exactly once.
Lacey Johnson (JMU)
July 25th, 2013
7 / 27
Sudoku and Shidoku

Most of you are familiar with Sudoku, played on a 9x9 grid. For the purpose of illustration, it will be convenient for us to work with a simpler version of Sudoku called Shidoku. A Shidoku board is a 4 4 Latin square whose regions (rows, columns, and designated 2 2 blocks) each contain the integers 14 exactly once.
4 4 3 1 2 1 3 4 2 1 2 1 3 4 1 2 4 3 4 3 1 2
Figure : Shidoku puzzle and completed board.
Lacey Johnson (JMU)
July 25th, 2013
7 / 27
Polynomial Representation of Shidoku

These constraints in a Shidoku board can be represented as a system of polynomials.
Lacey Johnson (JMU)
July 25th, 2013
8 / 27
Polynomial Representation of Shidoku

These constraints in a Shidoku board can be represented as a system of polynomials. Think of the 16 cells on a Shidoku board as 16 variables that can each take on only the values 1, 2, 3, or 4. For each of these variables w , we can encode this fact with a polynomial equation of the form (w 1)(w 2)(w 3)(w 4) = 0. (1)
a e i m
b f j n
c g k o
d h l p
Lacey Johnson (JMU)
July 25th, 2013
8 / 27
Rules of Shidoku
The numbers 1-4 must occur once in each row,
1 3 2 4 2 4 1 3 3 1 4 2 4 2 3 1
Lacey Johnson (JMU)
July 25th, 2013
9 / 27
Rules of Shidoku
1 3 2 4 2 4 1 3 3 1 4 2 4 2 3 1
each column,
1 3 2 4 2 4 1 3 3 1 4 2 4 2 3 1
Lacey Johnson (JMU)
July 25th, 2013
9 / 27
Rules of Shidoku
1 3 2 4 2 4 1 3 3 1 4 2 4 2 3 1
each column,
1 3 2 4 2 4 1 3 3 1 4 2 4 2 3 1
and each block.

1 3 2 4
Lacey Johnson (JMU) K-Potent Grbner bases and Sudoku
2 4 1 3
3 1 4 2
4 2 3 1
9 / 27
July 25th, 2013
Spider Diagram
This spider diagram allows us to better visualize which pairs of variables cant be equal to each other because they lie in the same row, column, or block. (Diagram by Laura Taalman)
Lacey Johnson (JMU) K-Potent Grbner bases and Sudoku July 25th, 2013 10 / 27
Spider Polynomials
Each leg of the spider needs a polynomial which we will call a spider polynomial.
Lacey Johnson (JMU)
July 25th, 2013
11 / 27
Spider Polynomials
Each leg of the spider needs a polynomial which we will call a spider polynomial. Consider any two variables, a and b, that lie in the same row, column, or block.
Lacey Johnson (JMU)
July 25th, 2013
11 / 27
Spider Polynomials
Each leg of the spider needs a polynomial which we will call a spider polynomial. Consider any two variables, a and b, that lie in the same row, column, or block. We already know that, (a 1)(a 2)(a 3)(a 4) = 0 and (b 1)(b 2)(b 3)(b 4) = 0
Lacey Johnson (JMU)
July 25th, 2013
11 / 27
Spider Polynomials
Each leg of the spider needs a polynomial which we will call a spider polynomial. Consider any two variables, a and b, that lie in the same row, column, or block. We already know that, (a 1)(a 2)(a 3)(a 4) = 0 and (b 1)(b 2)(b 3)(b 4) = 0 Expanding gives us, a4 10a3 + 35a2 50a + 24 = 0 and b4 10b3 + 35b2 50b + 24 = 0
Lacey Johnson (JMU)
July 25th, 2013
11 / 27
Spider Polynomials
Each leg of the spider needs a polynomial which we will call a spider polynomial. Consider any two variables, a and b, that lie in the same row, column, or block. We already know that, (a 1)(a 2)(a 3)(a 4) = 0 and (b 1)(b 2)(b 3)(b 4) = 0 Expanding gives us, a4 10a3 + 35a2 50a + 24 = 0 and b4 10b3 + 35b2 50b + 24 = 0 Therefore, a4 b4 10a3 + 10b3 + 35a2 35b2 50a + 50b = 0
Lacey Johnson (JMU)
July 25th, 2013
11 / 27
Spider Polynomial
Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50) = 0
Lacey Johnson (JMU)
July 25th, 2013
12 / 27
Spider Polynomial
Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50) = 0 We want to force a and b to take on different values. If a b = 0, we must have that a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50 = 0
Lacey Johnson (JMU)
July 25th, 2013
12 / 27
Spider Polynomial
Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50) = 0 We want to force a and b to take on different values. If a b = 0, we must have that a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50 = 0 This is our spider polynomial for a and b that we put into our ideal.
Lacey Johnson (JMU)
July 25th, 2013
12 / 27
Spider Polynomial
Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50) = 0 We want to force a and b to take on different values. If a b = 0, we must have that a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50 = 0 This is our spider polynomial for a and b that we put into our ideal. Spider polynomials ensure that any two variables in the same row, column, or block are not equal in value. Having a spider polynomial for each pair gives us 56 spider polynomials. Combining the 56 spider polynomials with the previous 16 regular variable polynomials gives us a total of 72 polynomials to represent the constraints on a Shidoku board.
Shidoku Ideal
We let the Shidoku polynomials be the generators for an ideal, I . Then we can use Buchbergers algorithm to compute a Grbner basis for I to get a new system of polynomials which gives us more information about the ideal.
Lacey Johnson (JMU)
July 25th, 2013
13 / 27
Shidoku Ideal
We let the Shidoku polynomials be the generators for an ideal, I . Then we can use Buchbergers algorithm to compute a Grbner basis for I to get a new system of polynomials which gives us more information about the ideal. If we add to the ideal polynomials which represent initial clues such as d -4, e-4, g -2, j -3, l -1, and m-1, the Grbner basis is this system of 16 linear polynomials that are the solutions to the Shidoku puzzle, i.e. a-3, b-2, c -1, d -4, e-4, f -1, g -2, h-3, i -2, j -3, k -4, l -1, m-1, n-4, o-3, p-2.
a e i m b f j n c g k o d h l p 4 4 3 1 2 1 3 4 2 1 2 1 3 4 1 2 4 3 4 3 1 2
Figure : Shidoku variables, puzzle, and board.

Sum-Product Shidoku System

Currently we are unable to use this representation to compute a Grbner basis for a 9x9 Sudoku puzzle because the computers memory overloads and the computation is stopped before we get to a Grbner basis .
Lacey Johnson (JMU)
July 25th, 2013
14 / 27

Currently we are unable to use this representation to compute a Grbner basis for a 9x9 Sudoku puzzle because the computers memory overloads and the computation is stopped before we get to a Grbner basis . Thus, we move on to the sum-product Shidoku system developed by E. Arnold, S. Lucas, and L. Taalman (Groebner Basis Representation of Sudoku, College Mathematics Journal 41 (2010) 101-111). This method requires fewer polynomials and is faster to compute.
Lacey Johnson (JMU)
July 25th, 2013
14 / 27

The sum-product system uses the regular variables previously mentioned, i.e. (a 1)(a 2)(a 3)(a 4) = 0.
Lacey Johnson (JMU)
July 25th, 2013
15 / 27

The sum-product system uses the regular variables previously mentioned, i.e. (a 1)(a 2)(a 3)(a 4) = 0. Consider four cells that make up a region on the Shidoku board, such as a row, column, or 2x 2 block on the board. Each cell in the region must have a different value: 1, 2, 3, or 4. The only way to choose four distinct numbers from the set {1, 2, 3, 4} whose sum is 10 and product is 24 is to choose each value exactly once.
Lacey Johnson (JMU)
July 25th, 2013
15 / 27

The sum-product system uses the regular variables previously mentioned, i.e. (a 1)(a 2)(a 3)(a 4) = 0. Consider four cells that make up a region on the Shidoku board, such as a row, column, or 2x 2 block on the board. Each cell in the region must have a different value: 1, 2, 3, or 4. The only way to choose four distinct numbers from the set {1, 2, 3, 4} whose sum is 10 and product is 24 is to choose each value exactly once. Let w , x , y , and z represent four cells in a Shidoku region. Then these two polynomials represent the constraints on a Shidoku region. w + x + y + z 10 = 0 and wxyz 24 = 0.
Lacey Johnson (JMU)
July 25th, 2013
15 / 27

The sum-product system uses the regular variables previously mentioned, i.e. (a 1)(a 2)(a 3)(a 4) = 0. Consider four cells that make up a region on the Shidoku board, such as a row, column, or 2x 2 block on the board. Each cell in the region must have a different value: 1, 2, 3, or 4. The only way to choose four distinct numbers from the set {1, 2, 3, 4} whose sum is 10 and product is 24 is to choose each value exactly once. Let w , x , y , and z represent four cells in a Shidoku region. Then these two polynomials represent the constraints on a Shidoku region. w + x + y + z 10 = 0 and wxyz 24 = 0. Together with the previous 16 regular variable polynomials and 24 region polynomials we have a total of 40 polynomial that encompass the rules of Shidoku.
Boolean Shidoku System

One approach which would limit degree growth is the Boolean Shidoku system. This system assigns four variables to each cell on the Shidoku board, i.e. a1 , a2 , a3 , a4 for cell a, giving us a total of 64 variables. So if cell a has the value 2, the variable a2 = 1 and all other variables a1 = a3 = a4 = 0. Therefore, for k = 1, 2, 3, 4 we have ak (ak 1) = 0.
Lacey Johnson (JMU)
July 25th, 2013
16 / 27

One approach which would limit degree growth is the Boolean Shidoku system. This system assigns four variables to each cell on the Shidoku board, i.e. a1 , a2 , a3 , a4 for cell a, giving us a total of 64 variables. So if cell a has the value 2, the variable a2 = 1 and all other variables a1 = a3 = a4 = 0. Therefore, for k = 1, 2, 3, 4 we have ak (ak 1) = 0. Simplifying we get,
2 =a . ak k
Lacey Johnson (JMU)
July 25th, 2013
16 / 27

2 =a . ak k
Using this idempotent variable restricts the degree growth.
Lacey Johnson (JMU)
July 25th, 2013
16 / 27

2 =a . ak k
Using this idempotent variable restricts the degree growth. However, the Boolean Shidoku system is actually slower than the sum-product Shidoku system. This is because the complexity of Buchbergers algorithm is double exponential in the number of variables.
K-Potent System
The k-potent variable system was developed by Arnold and Lucas to restrict degree growth and at the same time use only one variable for each cell. ak = a.
Lacey Johnson (JMU)
July 25th, 2013
17 / 27
K-Potent System
The k-potent variable system was developed by Arnold and Lucas to restrict degree growth and at the same time use only one variable for each cell. ak = a. ak a = 0.
Lacey Johnson (JMU)
July 25th, 2013
17 / 27
K-Potent System
The k-potent variable system was developed by Arnold and Lucas to restrict degree growth and at the same time use only one variable for each cell. ak = a. ak a = 0. For our purposes, the k-potent variable polynomials for a Shidoku system would be of the form a4 a = 0
Lacey Johnson (JMU)
July 25th, 2013
17 / 27
K-Potent System
The k-potent variable system was developed by Arnold and Lucas to restrict degree growth and at the same time use only one variable for each cell. ak = a. ak a = 0. For our purposes, the k-potent variable polynomials for a Shidoku system would be of the form a4 a = 0 a (a 3 1) = 0 a = 0 or a3 1 = 0
2 , W 3 , where W is a Notice, a can take on four values, a=0, W3 , W3 3 3 primitive third root of unity.
K-Potent Region Polynomials
Here is a graph of the three roots of unity.
Lacey Johnson (JMU)
July 25th, 2013
18 / 27
Here is a graph of the three roots of unity.

2 + W 3 = 0. Notice that, W3 + W3 3
( 1 2,
3 2 )
+ ( 1 2,
3 2 )
+ (1, 0)
(1, 0) + (1, 0) (0, 0)


When all the possible values for a are added together we get 0.
2 + W3 = 0 0 + W3 + W3 3
Lacey Johnson (JMU)
July 25th, 2013
19 / 27

2 + W3 = 0 0 + W3 + W3 3
We would like this to be a constraint for a Shidoku region. However, this cant be the only condition because it would allow all four variables in the region to take on the value 0, i.e. w = x = y = z = 0 0+0+0+0=0
Lacey Johnson (JMU)
July 25th, 2013
19 / 27

2 + W3 = 0 0 + W3 + W3 3
We would like this to be a constraint for a Shidoku region. However, this cant be the only condition because it would allow all four variables in the region to take on the value 0, i.e. w = x = y = z = 0 0+0+0+0=0 So if we let one of our regional polynomials be w +x +y +z =0 we must have another condition for this region to ensure that w , x , y , and z are distinct values.

2 , W 3 } whose The only combination of elements from the set {0, W3 , W3 3 sum is 0 are 1 + W 2 + W 3 = 0 and 0 + 0 + 0 + 0 = 0 0 + W3 3 3
Lacey Johnson (JMU)
July 25th, 2013
20 / 27

Thus, our second condition only needs to ensure that two variables in our regions are not equal.
Lacey Johnson (JMU)
July 25th, 2013
20 / 27

Thus, our second condition only needs to ensure that two variables in our regions are not equal. Notice, a spider polynomial would accomplish this goal. In fact, for every pair that needs to have different values we will use spider polynomials.
Lacey Johnson (JMU)
July 25th, 2013
20 / 27

We already computed spider polynomials using regular variables. So now were using k-potent variables to compute k-potent spider polynomials.
Lacey Johnson (JMU)
July 25th, 2013
21 / 27

We already computed spider polynomials using regular variables. So now were using k-potent variables to compute k-potent spider polynomials. Consider any two cells, a and b, that lie in the same row, column, or block. The conditions on the variables gives us a4 a = 0 and b4 b = 0
Lacey Johnson (JMU)
July 25th, 2013
21 / 27

We already computed spider polynomials using regular variables. So now were using k-potent variables to compute k-potent spider polynomials. Consider any two cells, a and b, that lie in the same row, column, or block. The conditions on the variables gives us a4 a = 0 and b4 b = 0 Therefore, a4 b 4 a + b = 0
Lacey Johnson (JMU)
July 25th, 2013
21 / 27
K-Potent Spider Polynomials

Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 1) = 0
Lacey Johnson (JMU)
July 25th, 2013
22 / 27

Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 1) = 0 If a b = 0, we need a3 + a2 b + ab2 + b3 1 = 0 This is the k-potent spider polynomial for a and b.
Lacey Johnson (JMU)
July 25th, 2013
22 / 27

Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 1) = 0 If a b = 0, we need a3 + a2 b + ab2 + b3 1 = 0 This is the k-potent spider polynomial for a and b. Recall the spider polynomial for regular variables: a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50 = 0
Lacey Johnson (JMU)
July 25th, 2013
22 / 27

Factoring out (a b) gives us, (a b)(a3 + a2 b + ab2 + b3 1) = 0 If a b = 0, we need a3 + a2 b + ab2 + b3 1 = 0 This is the k-potent spider polynomial for a and b. Recall the spider polynomial for regular variables: a3 + a2 b + ab2 + b3 10a2 10ab 10b2 + 35a + 35b 50 = 0 Notice the k-potent spider polynomial has fewer terms and no coefcients compared to the regular spider polynomial.

To build our k-potent region Shidoku system we begin with our 16 k-potent variable equations, a 4 a = 0.
Lacey Johnson (JMU)
July 25th, 2013
23 / 27

To build our k-potent region Shidoku system we begin with our 16 k-potent variable equations, a 4 a = 0. Then we set our rst variable condition for each region giving us 12 polynomial equations of this form a+b+c+d =0
Lacey Johnson (JMU)
July 25th, 2013
23 / 27

To build our k-potent region Shidoku system we begin with our 16 k-potent variable equations, a 4 a = 0. Then we set our rst variable condition for each region giving us 12 polynomial equations of this form a+b+c+d =0 Finally, for each region we need a spider polynomial to guarantee each variables is distinct. Again, we do this for each region so we have 12 polynomial equations of this form a3 + a2 b + ab2 + b3 1 = 0
Lacey Johnson (JMU)
July 25th, 2013
23 / 27

However, it turns out that we dont need 12 k-potent spider polynomials. We can economize and use 8 k-potent spider polynomials to represent the regions of the Shidoku board.
Lacey Johnson (JMU)
July 25th, 2013
24 / 27

However, it turns out that we dont need 12 k-potent spider polynomials. We can economize and use 8 k-potent spider polynomials to represent the regions of the Shidoku board. As you can see below, a pair of variables can count for a row and a block.
a e i m b f j n c g k o d h l p a e i m b f j n c g k o d h l p
Figure : Row and column k-potent spider polynomial pairs.
Lacey Johnson (JMU)
July 25th, 2013
24 / 27

However, it turns out that we dont need 12 k-potent spider polynomials. We can economize and use 8 k-potent spider polynomials to represent the regions of the Shidoku board. As you can see below, a pair of variables can count for a row and a block.
a e i m b f j n c g k o d h l p a e i m b f j n c g k o d h l p
Figure : Row and column k-potent spider polynomial pairs.
This leaves us with 8 k-potent spider polynomials. Altogether, this k-potent region Shidoku system contains 36 polynomials.
Results
Here are the computation times of the different variable and polynomial types. This was computed using Maple 16 on a 2.53 GHz Windows laptop with 4 GB RAM. Regular Var 66.35 sec 36.44 sec Boolean Var 46.11 sec K-Potent Var 33.60 sec 2.82 sec
Spider Poly Region Poly
Lacey Johnson (JMU)
July 25th, 2013
25 / 27
Conclusion
The system of polynomials with regular variables and spider polynomials has too many polynomials of high degree.
Lacey Johnson (JMU)
July 25th, 2013
26 / 27
Conclusion
The system of polynomials with regular variables and spider polynomials has too many polynomials of high degree. The sum-product Shidoku system with regular variables and region polynomials could compute a Grbner basis for Shidoku, but not for Sudoku.
Lacey Johnson (JMU)
July 25th, 2013
26 / 27
Conclusion
The system of polynomials with regular variables and spider polynomials has too many polynomials of high degree. The sum-product Shidoku system with regular variables and region polynomials could compute a Grbner basis for Shidoku, but not for Sudoku. The Boolean Shidoku system with idempotent variables and region polynomials restrict degree growth, but has too many variables.
Lacey Johnson (JMU)
July 25th, 2013
26 / 27
Conclusion
The system of polynomials with regular variables and spider polynomials has too many polynomials of high degree. The sum-product Shidoku system with regular variables and region polynomials could compute a Grbner basis for Shidoku, but not for Sudoku. The Boolean Shidoku system with idempotent variables and region polynomials restrict degree growth, but has too many variables. The k-potent Shidoku system with k-potent variables and region polynomials restricts degree growth and uses one variable per cell.
Lacey Johnson (JMU)
July 25th, 2013
26 / 27
Future Research
Develop k-potent system of regional polynomials for Sudoku. Write code to modify Buchbergers algorithm so it automatically reduces degree.
Lacey Johnson (JMU)
July 25th, 2013
27 / 27
Future Research
Develop k-potent system of regional polynomials for Sudoku. Write code to modify Buchbergers algorithm so it automatically reduces degree. I would like to thank my advisor Elizabeth Arnold at JMU.
Lacey Johnson (JMU)
July 25th, 2013
27 / 27
Future Research
Develop k-potent system of regional polynomials for Sudoku. Write code to modify Buchbergers algorithm so it automatically reduces degree. I would like to thank my advisor Elizabeth Arnold at JMU.
Thank you!
Lacey Johnson (JMU)
July 25th, 2013
27 / 27

Kpotenttalkfinalwebsite

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Kpotenttalkfinalwebsite

Uploaded by

Copyright:

Available Formats

K-Potent Grbner bases and Sudoku

Lacey Johnson James Madison University

Student Research Presentations - James Madison University July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

What is a Grbner basis?

What is a Grbner basis?

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

What is a Grbner basis?

What is a Grbner basis?

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Greatest Common Divisor

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Greatest Common Divisor

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Greatest Common Divisor

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Greatest Common Divisor

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Problems with Buchbergers Algorithm

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Problems with Buchbergers Algorithm

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Problems with Buchbergers Algorithm

Lacey Johnson (JMU)

K-Potent Grbner bases and Sudoku

July 25th, 2013

Sudoku and Shidoku