Looking for a creative or quick method for finding roots in GF(p^n)

Click For Summary

Discussion Overview

The discussion revolves around finding roots of irreducible polynomials of degree 3 in the finite field GF(27), specifically starting from the polynomial ## x^{27} - x ## over GF(3)[x]. Participants explore methods for identifying these roots without resorting to exhaustive checking of all elements in the field.

Discussion Character

  • Exploratory, Technical explanation, Conceptual clarification

Main Points Raised

  • One participant outlines the factorization of ## x^{27} - x ## into monic polynomials of degree 1 and 3, noting there are 11 such polynomials.
  • The same participant expresses difficulty in finding explicit roots for the irreducible polynomials of degree 3 in GF(27) and seeks methods beyond brute force checking.
  • Another participant suggests the use of proper LaTeX formatting for clarity in mathematical expressions.
  • A later post reiterates the initial problem and emphasizes the challenge of finding explicit roots in GF(27) for another irreducible polynomial, while also mentioning the potential for computer methods, which they prefer to avoid.
  • The original poster references two papers that may provide insights into the problem, indicating a connection to established research in the area.

Areas of Agreement / Disagreement

Participants do not reach a consensus on a specific method for finding roots, and the discussion remains open with various approaches and challenges presented.

Contextual Notes

The discussion highlights the complexity of finding roots in finite fields and the limitations of existing methods, with an emphasis on the need for creative or efficient techniques. There are references to specific mathematical constructs and theorems that may not be universally understood.

kmitza
Messages
17
Reaction score
4
TL;DR
I have been revising some calculation skills in Galois theory and I ran into a problem. if we have an irreducible polynomial of degree 3 over GF(3) and we construct GF(27) as GF(3)/<f> and we have another such polynomial g(x) how do we find it's explicit roots in GF(27)
I am going to give up a bit more on the given problem. We start with polynomial ## x^27 -x ## over GF(3)[x] and we factorize it using a well known theorem it turns out it factorises into the product of monic polynomials of degree 1 and 3, 11 of them all together.

We then choose one of those polynomials and consider ## GF(3)/<x^3+x^2+2> ## and we're asked to find roots for the other 7 irreducible polynomials of degree 3 in GF(27) constructed this way and give isomorphisms between ## GF(3)/<f> ## and ## GF(3)/<g> ## for each of them.

It's not hard to see how to give the isomorphism but I am struggling with finding the explicit roots. I am wondering if anyone knows of a good method for doing this that isn't just plugging in all 27 elements the first time and then 24 and so on...

I know that there are probably computer methods for doing this but I am not looking for those.
 
Physics news on Phys.org
Fix use {} around 27 for Latex.
 
mathman said:
Fix use {} around 27 for Latex.
Thanks for the tip!
 
kmitza said:
Summary:: I have been revising some calculation skills in Galois theory and I ran into a problem. if we have an irreducible polynomial of degree 3 over GF(3) and we construct GF(27) as GF(3)/<f> and we have another such polynomial g(x) how do we find it's explicit roots in GF(27)

I am going to give up a bit more on the given problem. We start with polynomial ## x^27 -x ## over GF(3)[x] and we factorize it using a well known theorem it turns out it factorises into the product of monic polynomials of degree 1 and 3, 11 of them all together.

We then choose one of those polynomials and consider ## GF(3)/<x^3+x^2+2> ## and we're asked to find roots for the other 7 irreducible polynomials of degree 3 in GF(27) constructed this way and give isomorphisms between ## GF(3)/<f> ## and ## GF(3)/<g> ## for each of them.

It's not hard to see how to give the isomorphism but I am struggling with finding the explicit roots. I am wondering if anyone knows of a good method for doing this that isn't just plugging in all 27 elements the first time and then 24 and so on...

I know that there are probably computer methods for doing this but I am not looking for those.
I have found two papers about it.
https://www.ams.org/journals/mcom/1...-1969-0257039-X/S0025-5718-1969-0257039-X.pdf
https://people.csail.mit.edu/dmoshkov/courses/codes/poly-factorization.pdf

I once met von zur Gathen, so I would start with the second one, but the first one is on the reference list of the second.
 

Similar threads

  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
2
Views
2K