Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Optimal Divisibility for Certain Diagonal Equations Over Finite Fields


Affiliations
1 Department of Mathematics and Computer Science, University of Puerto Rico, Rio Piedras, P.O. Box 23355 SJ, Puerto Rico 00931-3355, Puerto Rico
     

   Subscribe/Renew Journal


We improve the divisibility of diagonal equations of the type a1Xd1 1 + · · · + anXdn n = β over finite fields. This improvement gives cases where Ax’s, Moreno–Moreno’s and Wan’s results can be greatly improved. We prove that some of our estimates are the best possible. In particular, we compute the optimal divisibility for diagonal equations whenever di divides pj + 1. We present an algorithm in which we only need to do one simple computation to get the best divisibility of a family of diagonal equations with β = 0 for Fqm and we apply this in order to give the best p-adic Serre bound. Finally, we prove that every element of a finite field Fpf is the sum of two dth powers, when d divides pj + 1.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 233

PDF Views: 0




  • Optimal Divisibility for Certain Diagonal Equations Over Finite Fields

Abstract Views: 233  |  PDF Views: 0

Authors

Oscar Moreno
Department of Mathematics and Computer Science, University of Puerto Rico, Rio Piedras, P.O. Box 23355 SJ, Puerto Rico 00931-3355, Puerto Rico
Francis N. Castro
Department of Mathematics and Computer Science, University of Puerto Rico, Rio Piedras, P.O. Box 23355 SJ, Puerto Rico 00931-3355, Puerto Rico

Abstract


We improve the divisibility of diagonal equations of the type a1Xd1 1 + · · · + anXdn n = β over finite fields. This improvement gives cases where Ax’s, Moreno–Moreno’s and Wan’s results can be greatly improved. We prove that some of our estimates are the best possible. In particular, we compute the optimal divisibility for diagonal equations whenever di divides pj + 1. We present an algorithm in which we only need to do one simple computation to get the best divisibility of a family of diagonal equations with β = 0 for Fqm and we apply this in order to give the best p-adic Serre bound. Finally, we prove that every element of a finite field Fpf is the sum of two dth powers, when d divides pj + 1.