Counting polynomials with distinct zeros in finite fields

Abstract: Let

m a t h b b F_{q}

be a finite field with

q = p^{e}

elements, where

p

is a prime and

e g e q 1

is an integer. Let

e l l < n

be two positive integers. Fix a monic polynomial

u (x) = x^{n} + u_{n - 1} x^{n - 1} + c d o t s + u_{e l l + 1} x^{e l l + 1} i n m a t h b b F_{q} [x]

of degree

n

and consider all degree

n

monic polynomials of the form

f(x) = u(x) + v_ell(x), v_ell(x)=a_ell x^ell+a_{ell-1}x^{ell-1}+cdots+a_1x+a_0in mathbb{F}_q[x].

For integer

0 l e q k l e q m m i n n, q

, let

N_{k} (u (x), e l l)

denote the total number of

v_{e} l l (x)

such that

u (x) + v_{e} l l (x)

has exactly

k

distinct roots in

m a t h b b F_{q}

, i.e.

N_k(u(x),ell)=|{f(x)=u(x)+v_l(x) | f(x) { m has exactly} k { m distinct zeros in} mathbb{F}_q}|.

In this paper, we obtain explicit combinatorial formulae for

N_{k} (u (x), e l l)

when

n - e l l

is small, namely when

n - e l l = 1, 2, 3

. As an application, we define two kinds of Wenger graphs called jumped Wenger graphs and obtain their explicit spectrum.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Counting polynomials with distinct zeros in finite fields