Linearised polynomial

In mathematics, a linearised polynomial (or q- polynomial) is a polynomial for which the exponents of all the constituent monomials are powers of q and the coefficients come from some extension field of the finite field of order q.

We write a typical example as

L(x) = \sum_{i=0}^n a_i x^{q^i}, \text{ where each } a_i \text{ is in } F_{q^m} (\text { = } GF(q^m)) \text{ for some fixed positive integer }m.

This special class of polynomials is important from both a theoretical and an applications viewpoint.[1] The highly structured nature of their roots makes these roots easy to determine.

Properties

Symbolic multiplication

In general, the product of two linearised polynomials will not be a linearized polynomial, but since the composition of two linearised polynomials results in a linearised polynomial, composition may be used as a replacement for multiplication and, for this reason, composition is often called symbolic multiplication in this setting. Notationally, if L1(x) and L2(x) are linearised polynomials we define

L_1(x) \otimes L_2(x) = L_1(L_2(x))

when this point of view is being taken.

Associated polynomials

The polynomials L(x) and

 l(x) = \sum_{i=0}^n a_i x^i \

are q - associates (note: the exponents "qi " of L(x) have been replaced by "i" in l(x)). More specifically, l(x} is called the conventional q-associate of L(x), and L(x) is the linearised q-associate of l(x).

q-polynomials over Fq

Linearised polynomials with coefficients in Fq have additional properties which make it possible to define symbolic division, symbolic reducibility and symbolic factorizaton. Two important examples of this type of linearised polynomial are the Frobenius automorphism x \mapsto x^q and the trace function \operatorname{Tr}(x) = \sum_{i=0}^{n-1} x^{q^i}.

In this special case it can be shown that, as an operation, symbolic multiplication is commutative, associative and distributes over ordinary addition.[3] Also, in this special case, we can define the operation of symbolic division. If L(x) and L1(x) are linearised polynomials over Fq, we say that L1(x) symbolically divides L(x) if there exists a linearised polynomial L2(x) over Fq for which:

L(x) = L_1(x) \otimes L_2(x).

If L1(x) and L2(x) are linearised polynomials over Fq with conventional q-associates l1(x) and l2(x) respectively, then L1(x) symbolically divides L2(x) if and only if l1(x) divides l2(x).[4] Furthermore, L1(x) divides L2(x) in the ordinary sense in this case.[5]

A linearised polynomial L(x) over Fq of degree > 1 is symbolically irreducible over Fq if the only symbolic decompositions

L(x) = L_1(x) \otimes L_2(x),

with Li over Fq are those for which one of the factors has degree 1. Note that a symbolically irreducible polynomial is always reducible in the ordinary sense since any linearised polynomial of degree > 1 has the nontrivial factor x. A linearised polynomial L(x) over Fq is symbolically irreducible if and only if its conventional q-associate l(x) is irreducible over Fq.

Every q-polynomial L(x) over Fq of degree > 1 has a symbolic factorization into symbolically irreducible polynomials over Fq and this factorization is essentially unique (up to rearranging factors and multiplying by nonzero elements of Fq.)

For example,[6] consider the 2-polynomial L(x) = x16 + x8 + x2 + x over F2 and its conventional 2-associate l(x) = x4 + x3 + x + 1. The factorization into irreducibles of l(x) = (x2 + x + 1)(x + 1)2 in F2[x], gives the symbolic factorization

L(x) = (x^4 + x^2 + x) \otimes (x^2 + x) \otimes (x^2 + x).

Affine polynomials

Let L be a linearised polynomial over F_{q^n}. A polynomial of the form A(x) = L(x) - \alpha \text{ for } \alpha \in F_{q^n}, is an affine polynomial over F_{q^n}.

Theorem: If A is a nonzero affine polynomial over F_{q^n} with all of its roots lying in the field F_{q^s} an extension field of F_{q^n}, then each root of A has the same multiplicity, which is either 1, or a positive power of q.[7]

Notes

  1. Lidl & Niederreiter 1983, pg.107 (first edition)
  2. Mullen & Panario 2013, p. 23 (2.1.106)
  3. Lidl & Niederreiter 1983, pg. 115 (first edition)
  4. Lidl & Niederreiter 1983, pg. 115 (first edition) Corollary 3.60
  5. Lidl & Neiderreiter 1983, pg. 116 (first edition) Theorem 3.62
  6. Lidl & Neiderreiter 1983, pg. 117 (first edition) Example 3.64
  7. Mullen & Panario 2013, p. 23 (2.1.109)

References

This article is issued from Wikipedia - version of the Sunday, July 19, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.