• Aucun résultat trouvé

On some equations over finite fields

N/A
N/A
Protected

Academic year: 2022

Partager "On some equations over finite fields"

Copied!
6
0
0

Texte intégral

(1)

On

some

equations

over

finite fields

par IOULIA BAOULINA

RESUME. Dans ce papier, suivant L.

Carlitz,

nous considérons des

equations

particulières

à n variables sur le corps fini

a q

elements.

Nous obtenons des formules

explicites

pour le nombre de solutions de ces

equations,

sous une certaine condition sur n et q.

ABSTRACT. In this paper,

following

L. Carlitz we consider some

special

equations of n variables over the finite field

of q

elements.

We obtain

explicit

formulas for the number of solutions of these

equations, under a certain restriction on n and q.

1. Introduction and results

Let p be an odd rational

prime,

q =

ps,

s >

1,

and

Fq

be the finite field of q elements. In 1954 L. Carlitz

[4] proposed

the

problem

of

finding explicit

formula for the number of solutions in

Fg

of the

equation

where ... , an , b E

F* q

and n > 3. He obtained formulas for n = 3 and also for n = 4 and noted that for n > 5 it is a difficult

problem.

The

case

n = 3, al = a2 = a3 = l, b = 3 (so-called

Markoff

equation)

also

was treated

by

A.

Baragar [2].

In

particular,

he obtained

explicitly

the

zeta-function of the

corresponding hypersurface.

Let g

be a

generator

of the

cyclic

group

IFq .

It may be remarked that

by multiplying (1.1) by

a

properly

chosen element

ofF*

and also

by replacing

x2

by kixi

for

suitable ki

E

F~

and

permuting

the

variables,

the

equation

( 1.1 )

can be reduced to the form

where a E and

n/2

n. It follows from this that it is sufficient to evaluate the number of solutions of the

equation (1.2).

Let

Nq

denote the number of solutions in

Fg

of the

equation (1.2),

and

d =

gcd(n - 2, (q - 1)/2). Recently

the

present

author

[1]

obtained the

explicit

formulas for

Nq

in the cases when d = 1 and d = 2. Note that in

the case when d =

1, Nq

is

independent

of c.

In this paper we determine

explicitly Nq

if d is a

special

divisor of q - 1.

Our main results are the

following

two theorems.

(2)

Theorem 1.1.

Suppose

that d > 1 and there is a

positive integer

1 such

that 2d

I (pl

-E-

1)

with l chosen minimal. Then

where

Theorem 1.2.

Suppose

that 2

1

n, m =

n/2, 2d f (n - 2)

and there is a

positive integer

l such that d

I (pl

+

1).

Then

2.

Preliminary

lemmas

Let 0

be a nontrivial

multiplicative

character on

Fq.

We define sum

T(~) corresponding

to

character 0

as

(we extend o

to all

of Fq by setting 0(0)

=

0).

The Gauss sum

correspond- ing to 9

is defined as

where

Tr(y)

= y

+ yP + yP 2

+...

+ yP s-1

is the trace of y from

Fq

to

Fp.

In the

following

lemma we have an

expression

for

Nq

in terms of sums

(3)

Lemma 2.1. We have

-1

where

[n(q - 1)/4 is

the

greatest integer

less or

equal

to

n(q - 1)/4

and

-

means that the summation is taken over all nontrivial characters

1/J

of

order

dividing

d.

Proof.

See

[1,

Lemma

1].

D

Let 77

denote the

quadratic

character on

Fq (r(x) _ +1, -1, 0 according

x is a square, a non-square or zero in

Fq)-

In the next lemma we

give

the

expression

for sum

T(,O)

in terms of Gauss sums.

Lemma 2.2.

Let o

be a character

of

order 6 on

IFQ,

where J > 1 and 6

d.

Let A be a character on

Fq

chosen so that

A 2 == ’ljJ

and

Then

Proof.

See

[1,

Lemma

2].

0

The

following

lemma determines

explicitly

the values of certain Gauss

sums.

Lemma 2.3.

Let qp

be a

multiplicative

character

of

order 6 > 1 on

lFq.

*

Suppose

that there is a

positive integer 1

such

that 6 1 (pl

+

1)

and

211 [

s.

Then

I . -- I .--, 11 1 1.-1

Proof.

It is

analogous

to that of

[3,

Theorem

11.6.3~.

D

Now we use Lemmas 2.2 and 2.3 to evaluate the sum

T( 1/J)

in a

special

case.

(4)

Lemma 2.4.

Let 1/J

be a character

of

order 8 on

Fq,

where 8 > 1 and 8

d.

Suppose

that there is a

positive integer

1 such that 2J

I (pl

+

1)

and

2l s.

Then

Proof.

Let A be a character with the same conditions as in Lemma 2.2. If 6 is odd then the order of A is

equal J

and the order of

Aq

is

equal

25. Since

2J

I (pl

+

1)

and

2l ~

s,

by

Lemma

2.3,

it follows that

and

If 6 is even then A and

Aq

are the characters of order 26. Then similar

reasoning yields

In any case

G(A)2

=

Therefore, by

Lemma

2.2, T(9)

= 0 for

Now suppose that m = n. Since

(pi

+

1)/8

is even, it follows that

If 6 is odd then n +

((n - 2)/b)

is even, and from

(2.1), (2.2), (2.4)

and

Lemma 2.2 we obtain

and therefore lemma is established in this case.

If 6 is even then n is even, and

(2.3), (2.4)

and Lemma 2.2

imply

This

completes

the

proof

of Lemma 2.4.

(5)

3. Proof of the theorems

Proof of

Theorem 1.1. Since 2d

I (pl

+

1)

and 2d

I (q - 1),

it follows that 1

(mod 8). Appealing

to Lemmas 2.1 and

2.4,

we deduce

that

where

Thus,

from

(3.1)

and the well-known relation

Theorem 1.1 follows. D

Proof of

Theorem 1.2. Since d

I (n - 2), 2d t (n - 2)

and 2

1

n, it follows

that 2

d.

Therefore q - 1

(mod 4) and, by

Lemma

2.1,

Let 9

be a character of order 6 on

Fq,

where 6 > 1 and 6

1

d. If 26

1

d

then there is a

positive integer 1

such that 28 ~ +

1)

and

2l

s.

Thus, by

Lemma

2.4,

= 0. If

28 f d

then

dl6

and

(n - 2)/d

are odd. Therefore

(n - 2)/~

is odd

and, by

Lemma

2.2,

=

0,

as desired. D

(6)

References

[1] 1. BAOULINA, On the Problem of Explicit Evaluation of the Number of Solutions of the Equation

a1 x12

+ ... +

anxn2

= bx1...xn in a Finite Field. In Current Trends in Number

Theory, Edited by S. D. Adhikari, S. A. Katre and B. Ramakrishnan, Hindustan Book

Agency, New Delhi, 2002, 27-37.

[2] A. BARAGAR, The Markoff Equation and Equations of Hurwitz. Ph. D. Thesis, Brown University, 1991.

[3] B. C. BERNDT, R. J. EVANS, K. S. WILLIAMS, Gauss and Jacobi Sums. Wiley-Interscience,

New York, 1998.

[4] L. CARLITZ, Certain special equations in a finite field. Monatsh. Math. 58 (1954), 5-12.

loulia BAOULINA

The Institute of Mathematical Sciences CIT Campus, Taramani

Chennai 600113, India

E-rrtaiL : jbaulinaQmail . ru, baoulina@imsc.res.in

Références

Documents relatifs

Yet another approach to the problem of singular supports of con- volutions is due to Hormander [13]. Hormander uses the technique of plurisubharmonic functions. Besides having

many equivalence classes, the number of solutions of the S-unit equation (11) in coprime positive integers x, y, z is at most two... Evertse’s upper bound is not far

This enables us to study in a more detailed way in section 3 the case of nonsingular nonreflexive plane curves of degree p + 1, where p is the characteristic of

The description of such boundary singularities should play a key role in the understanding of the boundary behaviour of solutions of these equations (see [3] for the equation with

UE Introduction aux ´ equations aux d´ eriv´ ees partielles Deuxi` eme Session 17 juin 2008.. Tous les documents sont

We use this description to give a new factorization algorithm for skew polynomials, and to give other algorithms related to factorizations of skew polynomials, like counting the

Keywords: secret sharing; multisecret-sharing scheme; finite field; vector

The paper is organized as follows. In §1, we make an overview of the local study of the lin- ear differential equations. In particular, we remind how a meromorphic linear