constructing irreducible polynomials with prescribed level curves over finite fields构建不可约多项式与规定的水平曲线在有限的领域.pdfVIP

IJMMS 27:4 (2001) 197–200 PII. S0161171201011309 © Hindawi Publishing Corp. CONSTRUCTING IRREDUCIBLE POLYNOMIALS WITH PRESCRIBED LEVEL CURVES OVER FINITE FIELDS MIHAI CARAGIU (Received 14 January 2001 and in revised form 28 March 2001) Abstract. We use Eisenstein’s irreducibility criterion to prove that there exists an abso- lutely irreducible polynomial P(X,Y ) ∈ GF(q)[X,Y ] with coefficients in the finite field GF(q) with q elements, with prescribed level curves Xc := {(x,y) ∈ GF(q)2 |P(x,y) = c }. 2000 Mathematics Subject Classification. 11T06. 1. Introduction. Let GF(q) be the finite field with q elements. Assume that for any c ∈ GF(q), a subset Xc (possibly empty) of the finite affine plane GF(q)2 is given, such that Xc ∩Xd ≠ ∅ for any c ≠ d and GF(q)2 = Xc . (1.1) c ∈GF(q) In this paper, we use Eisenstein’s irreducibility criterion to build absolutely irreducible polynomials P(X,Y ) ∈ GF(q)[X,Y ] (1.2) such that for any c ∈ GF(q) the level curve {(x,y) ∈ GF(q)2 | P(x,y) = 0} coin- cides with Xc . Note that P(X,Y ) ∈ GF(q)[X,Y ] is called absolutely irreducible if it is irreducible over the algebraic closure of GF(q). If we define a function f : GF(q)2 → GF(q) taking a constant value c on the set Xc for any c ∈ GF(q), it is easy to see that this is equivalent to the fact that there exists an absolutely irreducible polynomial which interpolates the function f . It is of course well known that there exists a polynomial that interpolates the func- tion f (see [3, Section 7.5] for a general discussion on this topic). Thus, our resu