Permutation Polynomials and Polynomial Generators of a General Linear Group...
Transcript of Permutation Polynomials and Polynomial Generators of a General Linear Group...
![Page 1: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/1.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Permutation Polynomialsand Polynomial Generatorsof a General Linear Group
Chris CastilloLoyola Blakefield
MD-DC-VA Section of the MAAFall 2016 Meeting
Johns Hopkins UniversityNovember 5, 2016
![Page 2: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/2.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Finite Fields and Permutation Polynomials
Let p be prime and consider the finite field Fpn
Theorem (Lagrange Interpolation)
Any function ϕ : Fpn → Fpn may be represented as apolynomial f (X ) ∈ Fpn [X ] according to the formula:
f (X ) =∑x∈Fpn
(1− (X − x)p
n−1)ϕ(x).
Definition (Permutation Polynomial)
A polynomial f (X ) ∈ Fpn [X ] is a permutation polynomial if itinduces a bijection of Fpn under evaluation.
![Page 3: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/3.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Finite Fields and Permutation Polynomials
Let p be prime and consider the finite field Fpn
Theorem (Lagrange Interpolation)
Any function ϕ : Fpn → Fpn may be represented as apolynomial f (X ) ∈ Fpn [X ] according to the formula:
f (X ) =∑x∈Fpn
(1− (X − x)p
n−1)ϕ(x).
Definition (Permutation Polynomial)
A polynomial f (X ) ∈ Fpn [X ] is a permutation polynomial if itinduces a bijection of Fpn under evaluation.
![Page 4: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/4.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Finite Fields and Permutation Polynomials
Let p be prime and consider the finite field Fpn
Theorem (Lagrange Interpolation)
Any function ϕ : Fpn → Fpn may be represented as apolynomial f (X ) ∈ Fpn [X ] according to the formula:
f (X ) =∑x∈Fpn
(1− (X − x)p
n−1)ϕ(x).
Definition (Permutation Polynomial)
A polynomial f (X ) ∈ Fpn [X ] is a permutation polynomial if itinduces a bijection of Fpn under evaluation.
![Page 5: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/5.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Examples of Permutation Polynomials
Example (Linear polynomials)
aX + b for any a ∈ F∗pn and any b ∈ Fpn
Example (Monomials)
Xm if and only if (m, pn − 1) = 1
Example (All-ones polynomials)
1 + X + X 2 + · · ·+ X k if and only if k ≡ 1 (mod p(pn − 1))
Example (Dickson polynomials of the first kind)
gk(X , a) :=
b k2c∑j=0
k
k − j
(k − j
j
)(−a)jX k−2j for a ∈ F∗q
if and only if (k, (pn)2 − 1) = 1
![Page 6: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/6.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Examples of Permutation Polynomials
Example (Linear polynomials)
aX + b for any a ∈ F∗pn and any b ∈ Fpn
Example (Monomials)
Xm if and only if (m, pn − 1) = 1
Example (All-ones polynomials)
1 + X + X 2 + · · ·+ X k if and only if k ≡ 1 (mod p(pn − 1))
Example (Dickson polynomials of the first kind)
gk(X , a) :=
b k2c∑j=0
k
k − j
(k − j
j
)(−a)jX k−2j for a ∈ F∗q
if and only if (k, (pn)2 − 1) = 1
![Page 7: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/7.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Examples of Permutation Polynomials
Example (Linear polynomials)
aX + b for any a ∈ F∗pn and any b ∈ Fpn
Example (Monomials)
Xm if and only if (m, pn − 1) = 1
Example (All-ones polynomials)
1 + X + X 2 + · · ·+ X k if and only if k ≡ 1 (mod p(pn − 1))
Example (Dickson polynomials of the first kind)
gk(X , a) :=
b k2c∑j=0
k
k − j
(k − j
j
)(−a)jX k−2j for a ∈ F∗q
if and only if (k, (pn)2 − 1) = 1
![Page 8: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/8.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Examples of Permutation Polynomials
Example (Linear polynomials)
aX + b for any a ∈ F∗pn and any b ∈ Fpn
Example (Monomials)
Xm if and only if (m, pn − 1) = 1
Example (All-ones polynomials)
1 + X + X 2 + · · ·+ X k if and only if k ≡ 1 (mod p(pn − 1))
Example (Dickson polynomials of the first kind)
gk(X , a) :=
b k2c∑j=0
k
k − j
(k − j
j
)(−a)jX k−2j for a ∈ F∗q
if and only if (k, (pn)2 − 1) = 1
![Page 9: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/9.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Groups of Permutation Polynomials
Example (Linear monomials)
〈aX 〉 ∼= Cpn−1 for a fixed primitive a ∈ F∗pn
Example (Linear binomials)
〈X + b〉 ∼= Cp for a fixed b ∈ F∗pn
Example (Linearized polynomials)
〈L(X )〉 ∼= GL(Fpn) where L(X ) =∑n−1
i=0 `iXpi such that the
unique zero of L(X ) of 0
Example (Dickson polynomials of the first kind)
gk(X , a) is an abelian group if and only if a ∈ {−1, 0, 1}
![Page 10: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/10.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Groups of Permutation Polynomials
Example (Linear monomials)
〈aX 〉 ∼= Cpn−1 for a fixed primitive a ∈ F∗pn
Example (Linear binomials)
〈X + b〉 ∼= Cp for a fixed b ∈ F∗pn
Example (Linearized polynomials)
〈L(X )〉 ∼= GL(Fpn) where L(X ) =∑n−1
i=0 `iXpi such that the
unique zero of L(X ) of 0
Example (Dickson polynomials of the first kind)
gk(X , a) is an abelian group if and only if a ∈ {−1, 0, 1}
![Page 11: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/11.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Groups of Permutation Polynomials
Example (Linear monomials)
〈aX 〉 ∼= Cpn−1 for a fixed primitive a ∈ F∗pn
Example (Linear binomials)
〈X + b〉 ∼= Cp for a fixed b ∈ F∗pn
Example (Linearized polynomials)
〈L(X )〉 ∼= GL(Fpn) where L(X ) =∑n−1
i=0 `iXpi such that the
unique zero of L(X ) of 0
Example (Dickson polynomials of the first kind)
gk(X , a) is an abelian group if and only if a ∈ {−1, 0, 1}
![Page 12: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/12.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Groups of Permutation Polynomials
Example (Linear monomials)
〈aX 〉 ∼= Cpn−1 for a fixed primitive a ∈ F∗pn
Example (Linear binomials)
〈X + b〉 ∼= Cp for a fixed b ∈ F∗pn
Example (Linearized polynomials)
〈L(X )〉 ∼= GL(Fpn) where L(X ) =∑n−1
i=0 `iXpi such that the
unique zero of L(X ) of 0
Example (Dickson polynomials of the first kind)
gk(X , a) is an abelian group if and only if a ∈ {−1, 0, 1}
![Page 13: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/13.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
Let G be a group of order at most pn
1 Injection: σ : G ↪→ Fpn
2 Action of G on Fpn :
g ∗ x :=
{σ(g · σ−1(x)
), x ∈ σ(G )
x , x /∈ σ(G )
3 Interpolation:
fg (X ) =∑x∈Fpn
(1− (X − x)q−1
)(g ∗ x)
4 Operation: composition and reduction modulo X pn − X
![Page 14: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/14.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
Let G be a group of order at most pn
1 Injection: σ : G ↪→ Fpn
2 Action of G on Fpn :
g ∗ x :=
{σ(g · σ−1(x)
), x ∈ σ(G )
x , x /∈ σ(G )
3 Interpolation:
fg (X ) =∑x∈Fpn
(1− (X − x)q−1
)(g ∗ x)
4 Operation: composition and reduction modulo X pn − X
![Page 15: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/15.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
Let G be a group of order at most pn
1 Injection: σ : G ↪→ Fpn
2 Action of G on Fpn :
g ∗ x :=
{σ(g · σ−1(x)
), x ∈ σ(G )
x , x /∈ σ(G )
3 Interpolation:
fg (X ) =∑x∈Fpn
(1− (X − x)q−1
)(g ∗ x)
4 Operation: composition and reduction modulo X pn − X
![Page 16: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/16.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
Let G be a group of order at most pn
1 Injection: σ : G ↪→ Fpn
2 Action of G on Fpn :
g ∗ x :=
{σ(g · σ−1(x)
), x ∈ σ(G )
x , x /∈ σ(G )
3 Interpolation:
fg (X ) =∑x∈Fpn
(1− (X − x)q−1
)(g ∗ x)
4 Operation: composition and reduction modulo X pn − X
![Page 17: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/17.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
Let G be a group of order at most pn
1 Injection: σ : G ↪→ Fpn
2 Action of G on Fpn :
g ∗ x :=
{σ(g · σ−1(x)
), x ∈ σ(G )
x , x /∈ σ(G )
3 Interpolation:
fg (X ) =∑x∈Fpn
(1− (X − x)q−1
)(g ∗ x)
4 Operation: composition and reduction modulo X pn − X
![Page 18: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/18.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
fg(fh(X )
)= fgh(X ) (closure)
fe(X ) = X (identity)
fg (X )[−1] = fg−1(X ) (inverse)
Theorem
The representation polynomials form a group undercomposition modulo X pn − X which is isomorphic to G:
G ∼= {fg (X ) : g ∈ G} .
![Page 19: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/19.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
fg(fh(X )
)= fgh(X ) (closure)
fe(X ) = X (identity)
fg (X )[−1] = fg−1(X ) (inverse)
Theorem
The representation polynomials form a group undercomposition modulo X pn − X which is isomorphic to G:
G ∼= {fg (X ) : g ∈ G} .
![Page 20: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/20.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
fg(fh(X )
)= fgh(X ) (closure)
fe(X ) = X (identity)
fg (X )[−1] = fg−1(X ) (inverse)
Theorem
The representation polynomials form a group undercomposition modulo X pn − X which is isomorphic to G:
G ∼= {fg (X ) : g ∈ G} .
![Page 21: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/21.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Constructing Groups of Permutation Polynomials
fg(fh(X )
)= fgh(X ) (closure)
fe(X ) = X (identity)
fg (X )[−1] = fg−1(X ) (inverse)
Theorem
The representation polynomials form a group undercomposition modulo X pn − X which is isomorphic to G:
G ∼= {fg (X ) : g ∈ G} .
![Page 22: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/22.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Examples
Example (Cyclic group of order pn)
For any z ∈ {1, 2, . . . , pn − 1} and any primitive elementξ ∈ Fpn , the polynomials
ξX + ξz(
1 + ξ1−zX + (ξ1−zX )2 + · · ·+ (ξ1−zX )pn−2)
are permutation polynomials over Fpn .
Example (Cyclic group of order p2)
The polynomials
1± X + X p−1 + X 2(p−1) + · · ·+ X p2−p
are permutation polynomials over Fp2 .
![Page 23: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/23.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Examples
Example (Cyclic group of order pn)
For any z ∈ {1, 2, . . . , pn − 1} and any primitive elementξ ∈ Fpn , the polynomials
ξX + ξz(
1 + ξ1−zX + (ξ1−zX )2 + · · ·+ (ξ1−zX )pn−2)
are permutation polynomials over Fpn .
Example (Cyclic group of order p2)
The polynomials
1± X + X p−1 + X 2(p−1) + · · ·+ X p2−p
are permutation polynomials over Fp2 .
![Page 24: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/24.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Let Cp2 = 〈g〉
Fix a basis [β] = [β0, β1] of (Fp2 ,+) over Fp
Write the p-adic expansion of k as k = κ0 + κ1p
Write x ∈ Fp2 and x = λ0β0 + λ1β1
![Page 25: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/25.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Let Cp2 = 〈g〉Fix a basis [β] = [β0, β1] of (Fp2 ,+) over Fp
Write the p-adic expansion of k as k = κ0 + κ1p
Write x ∈ Fp2 and x = λ0β0 + λ1β1
![Page 26: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/26.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Let Cp2 = 〈g〉Fix a basis [β] = [β0, β1] of (Fp2 ,+) over Fp
Write the p-adic expansion of k as k = κ0 + κ1p
Write x ∈ Fp2 and x = λ0β0 + λ1β1
![Page 27: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/27.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Let Cp2 = 〈g〉Fix a basis [β] = [β0, β1] of (Fp2 ,+) over Fp
Write the p-adic expansion of k as k = κ0 + κ1p
Write x ∈ Fp2 and x = λ0β0 + λ1β1
![Page 28: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/28.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Injection:
σ(gk) = σ(gκ0+κ1p
)= κ0β0 + κ1β1
Action:
gk ∗ x = σ(gk · σ−1 (λ0β0 + λ1β1)
)= σ
(gκ0+κ1p · gλ0+λ1p
)= σ
(g (κ0+λ0)+(κ1+λ1)p
)=
{(κ0 + λ0)β0 + (κ1 + λ1)β1, κ0 + λ0 < p
(κ0 + λ0)β0 + (κ1 + λ1 + 1)β1, κ0 + λ0 ≥ p
=
{x + (κ0β0 + κ1β1), λ0 < p − κ0x + (κ0β0 + κ1β1) + β1, λ0 ≥ p − κ0
![Page 29: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/29.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Injection:
σ(gk) = σ(gκ0+κ1p
)= κ0β0 + κ1β1
Action:
gk ∗ x = σ(gk · σ−1 (λ0β0 + λ1β1)
)= σ
(gκ0+κ1p · gλ0+λ1p
)= σ
(g (κ0+λ0)+(κ1+λ1)p
)=
{(κ0 + λ0)β0 + (κ1 + λ1)β1, κ0 + λ0 < p
(κ0 + λ0)β0 + (κ1 + λ1 + 1)β1, κ0 + λ0 ≥ p
=
{x + (κ0β0 + κ1β1), λ0 < p − κ0x + (κ0β0 + κ1β1) + β1, λ0 ≥ p − κ0
![Page 30: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/30.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Example of Interest: Cp2
Cp2 = 〈g〉Let [β] = [β0, β1] be a basis of (Fp2 ,+) over Fp
Write k = κ0 + κ1p
Example (The “Additive Representation” of Cp2)
f[β0,β1]gκ0+κ1p
(X ) = X + κ0β0 + κ1β1
− β1p−1∑
λ0=p−κ0
p−1∑λ1=0
p2−2∑`=0
((λ0β0 + λ1β1)−1X
)`
![Page 31: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/31.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Equivalence of Representations
Definition (Equivalence)
The polynomial representations f , f ′ generated byσ, σ′ : G ↪→ Fpn , respectively, are equivalent if there exists agroup automorphism α : (Fpn ,+)→ (Fpn ,+) such that forall g ∈ G ,
fg (X ) =(α−1 ◦ f ′g ◦ α
)(X ).
![Page 32: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/32.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Equivalence of Polynomials Representing Cp2
Theorem
The “additive representations” of Cp2 in any two bases [β]and [γ] of (Fp2 ,+) over Fp are equivalent.
Moreover,
f[γ]g
(X ) = L(X )[−1] ◦ f [β]g
(X ) ◦ L(X ),
where L(X ) is a polynomial of the form
L(X ) = `1Xp + `0X
that represents the change of basis of (Fp2 ,+) from [γ] to [β].
![Page 33: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/33.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Equivalence of Polynomials Representing Cp2
Theorem
The “additive representations” of Cp2 in any two bases [β]and [γ] of (Fp2 ,+) over Fp are equivalent. Moreover,
f[γ]g
(X ) = L(X )[−1] ◦ f [β]g
(X ) ◦ L(X ),
where L(X ) is a polynomial of the form
L(X ) = `1Xp + `0X
that represents the change of basis of (Fp2 ,+) from [γ] to [β].
![Page 34: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/34.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Equivalence of Polynomials Representing Cpn
Theorem
The “additive representations” of Cpn in any two bases [β]and [γ] of (Fpn ,+) over Fp are equivalent. Moreover,
f[γ]g
(X ) = L(X )[−1] ◦ f [β]g
(X ) ◦ L(X ),
where L(X ) is a polynomial of the form
L(X ) =n−1∑i=0
`iXpi
that represents the change of basis of (Fpn ,+) from [γ] to [β].
![Page 35: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/35.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Equivalence of Polynomials Representing Cp2
Theorem
Let [β0, β1] and [γ0, γ1] be two bases of (Fp2 ,+) over Fp .Then there exist unique r ∈ F∗p2 , s ∈ Fp , and t ∈ F∗p such that
f[γ0,γ1]g
(X ) =(Nt(Ms(rX )
)[−1] ◦ f [β0,β1]g
(X ) ◦ Nt(Ms(rX )),
where
Ms(X ) =1
βp0β1 − β0βp1
(sβ21X
p + (βp0β1 − β0βp1 − sβp+1
1 )X)
and
Nt(X ) =1
βp−10 − βp−11
((t − 1)X p + (βp−10 − tβp−11 )X
).
![Page 36: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/36.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
The Unexpected Result
Theorem (Generators of GL(Fp2))
Let β0, β1 ∈ Fp2 be linearly independent over Fp , let ρ ∈ F∗p2be primitive, and let ψ, τ ∈ Fp with τ nonzero. Then thepolynomials ρX,
Mψ(X ) =1
βp0β1 − β0βp1
(ψβ21X
p + (βp0β1 − β0βp1 − ψβ
p+11 )X
)and
Nτ (X ) =1
βp−10 − βp−11
((τ − 1)X p + (βp−10 − τβp−11 )X
)generate a group of permutation polynomials isomorphic to thegeneral linear group GL(Fp2).
![Page 37: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/37.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Thank you for attending!
Are there any questions?
![Page 38: Permutation Polynomials and Polynomial Generators of a General Linear Group …sections.maa.org/mddcva/MeetingFiles/Fall2016Meeting/... · 2016-11-07 · p2) Introduction Permutation](https://reader035.fdocuments.in/reader035/viewer/2022081407/5f90e40ef09d4063e6725368/html5/thumbnails/38.jpg)
PermutationPolynomialsand GL(F
p2)
Introduction
PermutationPolynomialsRepresentingGroups
Equivalence ofGroups ofPolynomials
AnUnexpectedResult aboutGL(F
p2)
Thank you for attending!
Are there any questions?