The coefficients of primitive polynomials over finite fields

For , we prove that there always exists a primitive polynomial of degree over a finite field with the first and second coefficients prescribed in advance.

     

Moment subset sums over finite fields

The k-subset sum problem over finite fields is a classical NP-complete problem. Motivated by coding theory applications, a more complex problem is the higher m-th moment k-subset sum problem over finite fields. We show that there is a deterministic polynomial time algorithm for the m-th moment k-subset sum problem over finite fields for each fixed m when the evaluation set is the image set of a monomial or Dickson polynomial of any degree n. In the classical case $m=1$, this recovers previous results of Nguyen-Wang (the case $m=1,p>2$) [22] and the results of Choe-Choe (the case $m=1,p=2$) [3].     

On a conjecture of Fernando,Hou and Lappano concerning permutation polynomials over finite fields

Let ${\mathbb{F}}_q$ be the finite field with q elements and let $p=\text{char}{\mathbb{F}}_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots +X^{q^a-2}$ is a permutation polynomial of ${\mathbb{F}}_{q^e}$ if and only if (i) $a=2$ and $q=2$, or (ii) $a=1$ and $\text{gcd}(q-2,q^e-1)=1$. In the present paper we confirm this conjecture.     

Algebraic geometry codes over abelian surfaces containing no absolutely irreducible curves of low genus

We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the assumption that the abelian surface does not contain low genus curves. This approach naturally leads us to consider Weil restrictions of elliptic curves and abelian surfaces which do not admit a principal polarization.     

Permutation polynomials from trace functions over finite fields

In this paper, we propose several classes of permutation polynomials based on trace functions over finite fields of characteristic 2. The main result of this paper is obtained by determining the number of solutions of certain equations over finite fields.     

Root numbers of abelian varieties

We generalize a theorem of D. Rohrlich concerning root numbers of elliptic curves over number fields. Our result applies to arbitrary abelian varieties. Namely, under certain conditions which naturally extend the conditions used by D. Rohrlich, we show that the root number associated to an abelian variety over a number field and a complex finite-dimensional irreducible representation of with real-valued character is equal to . We also show that our result is consistent with a refined version of the conjecture of Birch and Swinnerton-Dyer.

     

On the number of distinct roots of a lacunary polynomial over finite fields

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.     

Several classes of complete permutation polynomials over finite fields of even characteristic

In this paper, we find three classes of complete permutation polynomials over finite fields of even characteristic. The first class of quadrinomials is complete in the sense of addition. The second and third classes of binomials and trinomials are complete in multiplication. Moreover, a result related to the complete property in multiplication of a special class of polynomials is also given.     

On eight-dimensional unital division algebras over finite fields

The purpose of this paper is to investigate the eight-dimensional non-associative unital division algebras {0}≠A over finite fields, admitting elementary abelian 2-group of automorphisms E≤Aut(A), of order 8, using tools from algebraic geometry.