7.497
7.009
7.3
7.5
6.097
6.695
8.463
6.903
No More Posts Available.
No more pages to load.
- Source: Conway polynomial (finite fields)
In mathematics, the Conway polynomial Cp,n for the finite field Fpn is a particular irreducible polynomial of degree n over Fp that can be used to define a standard representation of Fpn as a splitting field of Cp,n. Conway polynomials were named after John H. Conway by Richard A. Parker, who was the first to define them and compute examples. Conway polynomials satisfy a certain compatibility condition that had been proposed by Conway between the representation of a field and the representations of its subfields. They are important in computer algebra where they provide portability among different mathematical databases and computer algebra systems. Since Conway polynomials are expensive to compute, they must be stored to be used in practice. Databases of Conway polynomials are available in the computer algebra systems GAP, Macaulay2, Magma, SageMath, at the web site of Frank LĆ¼beck,
and at the Online Encyclopedia of Integer Sequences.
Background
Elements of Fpn may be represented as sums of the form anā1Ī²nā1 + ā¦ + a1Ī² + a0 where Ī² is a root of an irreducible polynomial of degree n over Fp and the aj are elements of Fp. Addition of field elements in this representation is simply vector addition. While there is a unique finite field of order pn up to isomorphism, the representation of the field elements depends on the choice of irreducible polynomial. The Conway polynomial is a way of standardizing this choice.
The non-zero elements of a finite field F form a cyclic group under multiplication, denoted F*. A primitive element, Ī±, of Fpn is an element that generates F*pn. Representing the non-zero field elements as powers of Ī± allows multiplication in the field to be performed efficiently. The primitive polynomial for Ī± is the monic polynomial of smallest possible degree with coefficients in Fp that has Ī± as a root in Fpn (the minimal polynomial for Ī±). It is necessarily irreducible. The Conway polynomial is chosen to be primitive, so that each of its roots generates the multiplicative group of the associated finite field.
The field Fpn contains a unique subfield isomorphic to Fpm for each m dividing n, and this accounts for all the subfields of Fpn. For any m dividing n the cyclic group F*pn contains a subgroup isomorphic to F*pm. If Ī± generates F*pn, then the smallest power of Ī± that generates this subgroup is Ī±r where r = (pn ā 1) / (pm ā 1). If fn is a primitive polynomial for Fpn with root Ī± and fm is a primitive polynomial for Fpm then, by Conway's definition, fm and fn are compatible if Ī±r is a root of fm. This necessitates that fn(x) divide fm(xr). This notion of compatibility is called norm-compatibility by some authors. The Conway polynomial for a finite field is chosen so as to be compatible with the Conway polynomials of each of its subfields. That it is possible to make the choice in this way was proved by Werner Nickel.
Definition
The Conway polynomial Cp,n is defined as the lexicographically minimal monic primitive polynomial of degree n over Fp that is compatible with Cp,m for all m dividing n. This is an inductive definition on n: the base case is Cp,1(x) = x ā Ī± where Ī± is the lexicographically minimal primitive element of Fp. The notion of lexicographical ordering used is the following:
The elements of Fp are ordered 0 < 1 < 2 < ā¦ < p ā 1.
A polynomial of degree d in Fp[x] is written adxd ā adā1xdā1 + ā¦ + (ā1)da0 (with terms alternately added and subtracted) and then expressed as the word ad adā1 ā¦ a0. Two polynomials of degree d are ordered according to the lexicographical ordering of their corresponding words.
Since there does not appear to be any natural mathematical criterion that would single out one monic primitive polynomial satisfying the compatibility conditions over all the others, the imposition of lexicographical ordering in the definition of the Conway polynomial should be regarded as a convention.
Table
Conway polynomials Cp,n for the lowest values of p and n are tabulated below. All of these were first computed by Richard Parker and were taken from the tables of Frank Luebeck. The calculations can be verified using the basic methods of the next section with the assistance of algebra software.
Examples
To illustrate the definition, let us compute the first six Conway polynomials over F5. By definition, a Conway polynomial is monic, primitive (which implies irreducible), and compatible with Conway polynomials of degree dividing its degree. The table below shows how imposing each of these conditions reduces the number of candidate polynomials.
Degree 1. The primitive elements of F5 are 2 and 3. The two degree-1 polynomials with primitive roots are therefore x ā 2 = x + 3 and x ā 3 = x + 2, which correspond to the words 12 and 13, Since 12 is less than 13 in lexicographic ordering, C5,1(x) = x + 3.
Degree 2. Since (52 ā 1) / (51 ā 1) = 6, compatibility requires that C5,2 be chosen so that C5,2(x) divides C5,1(x6) = x6 + 3. The latter factorizes into three degree-2 polynomials, irreducible over F5, namely x2 + 2, x2 + x + 2, and x2 + 4x + 2. Of these x2 + 2 is not primitive since it divides x8 ā 1 implying that its roots have order at most 8, rather than the required 24. Both of the others are primitive and C5,2 is chosen to be the lexicographically lesser of the two. Now x2 + x + 2 = x2 ā 4x + 2 corresponds to the word 142 and x2 + 4x + 2 = x2 ā x + 2 corresponds to the word 112, the latter being lexicographically less than the former. Hence C5,2(x) = x2 + 4x + 2.
Degree 3. Since (53 ā 1) / (51 ā 1) = 31, compatibility requires that C5,3(x) divide C5,1(x31) = x31 + 3, which factorizes as a degree-1 polynomial times the product of ten primitive degree-3 polynomials. Of these, two have no quadratic term, x3 + 3x + 3 = x3 ā 0x2 + 3x ā 2 and x3 + 4x + 3 = x3 ā 0x2 + 4x ā 2, which correspond to the words 1032 and 1042. As 1032 is lexicographically less than 1042, C5,3(x) = x3 + 3x + 3.
Degree 4. The proper divisors of 4 are 1 and 2. Compute (54 ā 1) / (52 ā 1) = 26 and (54 ā 1) / (51 ā 1) = 156, and note that 156 / 26 = (52 ā 1) / (52 ā 1) = 6, the same exponent as appeared in the compatibility condition for degree 2. In degree 4, compatibility requires that C5,4 be chosen so that C5,4(x) divides both C5,2(x26) = x52 + 4x26 + 2 and C5,1(x156) = x156 + 3. The second condition is redundant, however, because of the compatibility condition imposed when choosing C5,2, which implies that C5,2(x26) divides C5,1(x156). In general, for composite degree d, the same reasoning implies that only the maximal proper divisors of d need be considered, that is, divisors of the form d / p, where p is a prime divisor of d. There are 13 factors of C5,2(x26), all of degree 4. All but one are primitive. Of the primitive ones, x4 + 4x2 + 4x + 2 is lexicographically minimal.
Degree 5. The computation is similar to what was done in degrees 2 and 3: (55 ā 1) / (51 ā 1) = 781; C5,1(x781) = x781 + 3 has one factor of degree 1 and 156 factors of degree 5, of which 140 are primitive. The lexicographically least of the primitive factors is x5 + 4x + 3.
Degree 6. Taking into consideration the discussion above in connection with degree 4, the two compatibility conditions that need to be considered are that C5,6(x) must divide C5,2(x651) = x1302 + 4x651 + 2 and C5,3(x126) = x378 + 3x126 + 3. It therefore must divide their greatest common divisor, x126 + x105 + 2x84 + 3x42 + 2, which factorizes into 21 degree-6 polynomials, 18 of which are primitive. The lexicographically least of these is x6 + x4 + 4x3 + x2 + 2.
Computation
Algorithms for computing Conway polynomials that are more efficient than brute-force search have been developed by Heath and Loehr. LĆ¼beck indicates that their algorithm is a rediscovery of the method of Parker.
Notes
References
Holt, Derek F.; Eick, Bettina; O'Brien, Eamonn A. (2005), Handbook of computational group theory, Discrete mathematics and its applications, vol. 24, CRC Press, ISBN 978-1-58488-372-2
Kata Kunci Pencarian:
