scholarly journals Characterization and Enumeration of Good Punctured Polynomials over Finite Fields

2016 ◽  
Vol 2016 ◽  
pp. 1-7
Author(s):  
Somphong Jitman ◽  
Aunyarut Bunyawat ◽  
Supanut Meesawat ◽  
Arithat Thanakulitthirat ◽  
Napat Thumwanit
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Lower Bounds ◽  
Complete Characterization ◽  
Binary Field ◽  
Polynomials Over Finite Fields

A family of good punctured polynomials is introduced. The complete characterization and enumeration of such polynomials are given over the binary fieldF2. Over a nonbinary finite fieldFq, the set of good punctured polynomials of degree less than or equal to2are completely determined. Forn≥3, constructive lower bounds of the number of good punctured polynomials of degreenoverFqare given.

scholarly journals Short Kloosterman Sums for Polynomials over Finite Fields

2003 ◽  
Vol 55 (2) ◽  
pp. 225-246 ◽  
Author(s):  
William D. Banks ◽  
Asma Harcharras ◽  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Small Degree ◽  
Kloosterman Sums ◽  
Degree Relative ◽  
Irreducible Polynomials ◽  
Arbitrary Polynomial ◽  
Polynomials Over Finite Fields ◽  
Titchmarsh Theorem

AbstractWe extend to the setting of polynomials over a finite field certain estimates for short Kloosterman sums originally due to Karatsuba. Our estimates are then used to establish some uniformity of distribution results in the ring [x]/M(x) for collections of polynomials either of the form f−1g−1 or of the form f−1g−1 + afg, where f and g are polynomials coprime to M and of very small degree relative to M, and a is an arbitrary polynomial. We also give estimates for short Kloosterman sums where the summation runs over products of two irreducible polynomials of small degree. It is likely that this result can be used to give an improvement of the Brun-Titchmarsh theorem for polynomials over finite fields.

The Distribution of Zeros of Quadratic Forms over Finite Fields

2015 ◽  
Vol 7 (2) ◽  
pp. 18
Author(s):  
Ali H. Hakami
Keyword(s):  
Positive Integer ◽  
Quadratic Form ◽  
Finite Field ◽  
Finite Fields ◽  
Lower Bounds ◽  
Quadratic Forms ◽  
Distribution Of Zeros ◽  
Linearly Independent ◽  
Set Of Points

Let $m$ be a positive integer with $m < p/2$ and $p$ is a prime. Let $\mathbb{F}_q$ be the finite field in $q = p^f$ elements, $Q({\mathbf{x}})$ be a nonsinqular quadratic form over $\mathbb{F}_q$ with $q$ odd, $V$ be the set of points in $\mathbb{F}_q^n$ satisfying the equation $Q({\mathbf{x}}) = 0$ in which the variables are restricted to a box of points of the type\[\mathcal{B}(m) = \left\{ {{\mathbf{x}} \in \mathbb{F}_q^n \left| {x_i  = \sum\limits_{j = 1}^f {x_{ij} \xi _j } ,\;\left| {x_{ij} } \right| < m,\;1 \leqslant i \leqslant n,\;1 \leqslant j \leqslant f} \right.} \right\},\]where $\xi _1 , \ldots ,\xi _f$ is a basis for $\mathbb{F}_q$ over $\mathbb{F}_p$ and $n > 2$ even. Set $\Delta  = \det Q$ such that $\chi \left( {( - 1)^{n/2} \Delta } \right) = 1.$ We shall motivate work of (Cochrane, 1986) to obtain lower bounds on $m,$ size of the box $\mathcal{B},$ so that $\mathcal{B} \cap V$ is nonempty. For this we show that the box $\mathcal{B}(m)$ contains a zero of $Q({\mathbf{x}})$ provided that $m \geqslant p^{1/2}.$ We also show that the box $\mathcal{B}(m)$ contains $n$ linearly independent zeros of $Q({\mathbf{x}})$ provided that $m \geqslant 2^{n/2} p^{1/2} .$

DEGREE MATRICES AND ESTIMATES FOR EXPONENTIAL SUMS OF POLYNOMIALS OVER FINITE FIELDS

2013 ◽  
Vol 12 (07) ◽  
pp. 1350030 ◽  
Author(s):  
WEI CAO
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Exponential Sums ◽  
Elementary Approach ◽  
Multivariate Polynomial ◽  
Elementary Divisors ◽  
Polynomials Over Finite Fields ◽  
Degree Matrix

Let f be a multivariate polynomial over a finite field and its degree matrix be composed of the degree vectors appearing in f. In this paper, we provide an elementary approach to estimating the exponential sums of the polynomials with positive square degree matrices in terms of the elementary divisors of the degree matrices.

A SPECIAL DEGREE REDUCTION OF POLYNOMIALS OVER FINITE FIELDS WITH APPLICATIONS

2011 ◽  
Vol 07 (04) ◽  
pp. 1093-1102 ◽  
Author(s):  
WEI CAO
Keyword(s):  
Finite Field ◽  
Explicit Formula ◽  
Finite Fields ◽  
Rational Points ◽  
Degree Reduction ◽  
Affine Hypersurface ◽  
Special Degree ◽  
Low Degree ◽  
Polynomials Over Finite Fields ◽  
Degree Matrix

Let f be a polynomial in n variables over the finite field 𝔽q and Nq(f) denote the number of 𝔽q-rational points on the affine hypersurface f = 0 in 𝔸n(𝔽q). A φ-reduction of f is defined to be a transformation σ : 𝔽q[x1, …, xn] → 𝔽q[x1, …, xn] such that Nq(f) = Nq(σ(f)) and deg f ≥ deg σ(f). In this paper, we investigate φ-reduction by using the degree matrix which is formed by the exponents of the variables of f. With φ-reduction, we may improve various estimates on Nq(f) and utilize the known results for polynomials with low degree. Furthermore, it can be used to find the explicit formula for Nq(f).

scholarly journals The reducibility theorem for linearised polynomials over finite fields

1989 ◽  
Vol 40 (3) ◽  
pp. 407-412 ◽  
Author(s):  
Stephen D. Cohen
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Irreducible Polynomials ◽  
Polynomials Over Finite Fields ◽  
Wide Readership

A self-contained elementary account is given of the theorem of S. Agou that classifies all composite irreducible polynomials of the form over a finite field of characteristic p. Written to appeal to a wide readership, it is intended to complement the original rather technical proof and other contributions by the author and by Moreno.

scholarly journals The factorable core of polynomials over finite fields

1990 ◽  
Vol 49 (2) ◽  
pp. 309-318 ◽  
Author(s):  
S. D. Cohen
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Algebraic Closure ◽  
Permutation Polynomials ◽  
Linearized Polynomial ◽  
Polynomials Over Finite Fields ◽  
Value Sets

AbstractFor a polynomial f(x) over a finite field Fq, denote the polynomial f(y)−f(x) by ϕf(x, y). The polynomial ϕf has frequently been used in questions on the values of f. The existence is proved here of a polynomial F over Fq of the form F = Lr, where L is an affine linearized polynomial over Fq, such that f = g(F) for some polynomial g and the part of ϕf which splits completely into linear factors over the algebraic closure of Fq is exactly φF. This illuminates an aspect of work of D. R. Hayes and Daqing Wan on the existence of permutation polynomials of even degree. Related results on value sets, including the exhibition of a class of permutation polynomials, are also mentioned.

Zeros of random polynomials over finite fields

1992 ◽  
Vol 111 (2) ◽  
pp. 193-197 ◽  
Author(s):  
R. W. K. Odoni
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Prime Power ◽  
Random Polynomials ◽  
Polynomials Over Finite Fields ◽  
Image Position

Let be the finite field with q elements (q a prime power), let r 1 and let X1, , Xr be independent indeterminates over . We choose an arbitrary and a d 1 and consider

scholarly journals On the set of distances between two sets over finite fields

2006 ◽  
Vol 2006 ◽  
pp. 1-5 ◽  
Author(s):  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Lower Bounds ◽  
Exponential Sums

We use bounds of exponential sums to derive new lower bounds on the number of distinct distances between all pairs of points(x,y)∈×ℬfor two given sets,ℬ∈Fqn, whereFqis a finite field ofqelements andn≥1is an integer.

scholarly journals SOME FAMILIES OF PERMUTATION POLYNOMIALS OVER FINITE FIELDS

2008 ◽  
Vol 04 (05) ◽  
pp. 851-857 ◽  
Author(s):  
MICHAEL E. ZIEVE
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Permutation Polynomials ◽  
Polynomials Over Finite Fields ◽  
Necessary And Sufficient

We give necessary and sufficient conditions for a polynomial of the form xr(1 + xv + x2v + ⋯ + xkv)t to permute the elements of the finite field 𝔽q. Our results yield especially simple criteria in case (q - 1)/ gcd (q - 1, v) is a small prime.

scholarly journals On the heuristic of approximating polynomials over finite fields by random mappings

2016 ◽  
Vol 12 (07) ◽  
pp. 1987-2016 ◽  
Author(s):  
Rodrigo S. V. Martins ◽  
Daniel Panario
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Asymptotic Properties ◽  
Polynomials Over Finite Fields ◽  
Functional Graph ◽  
Random Mappings ◽  
Approximating Polynomials ◽  
Mapping Models ◽  
Quartic Polynomials ◽  
Class Of Functions

The behavior of iterations of functions is frequently approximated by the Brent–Pollard heuristic, where one treats functions as random mappings. We aim at understanding this heuristic and focus on the expected rho length of a node of the functional graph of a polynomial over a finite field. Since the distribution of preimage sizes of a class of functions appears to play a central role in its average rho length, we survey the known results for polynomials over finite fields giving new proofs and improving one of the cases for quartic polynomials. We discuss the effectiveness of the heuristic for many classes of polynomials by comparing our experimental results with the known estimates for different random mapping models. We prove that the distribution of preimage sizes of general polynomials and mappings have similar asymptotic properties, including the same asymptotic average coalescence. The combination of these results and our experiments suggests that these polynomials behave like random mappings, extending a heuristic that was known only for degree [Formula: see text]. We show numerically that the behavior of Chebyshev polynomials of degree [Formula: see text] over finite fields present a sharp contrast when compared to other polynomials in their respective classes.

Sign in / Sign up

Export Citation Format

Share Document