On irreducible polynomials of certain types in finite fields

1969 ◽  
Vol 66 (2) ◽  
pp. 335-344 ◽  
Author(s):  
Stephen D. Cohen
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Fields ◽  
Monic Polynomial ◽  
Irreducible Polynomials ◽  
Image Position

Let GF(q) be the finite field containing q = pl elements, where p is a prime and l a positive integer. Let P(x) be a monic polynomial in GF[q, x] of degree m. In this paper we investigate the nature and distribution of monic irreducible polynomials of the following types:(I) P(xr), where r is a positive integer (r-polynomials).(II) xm P(x + x−1). (Reciprocal polynomials.) These have the form(III) xrmP(xr + x−r). (r-reciprocal polynomials.) These have the form Q(xr), where q(x) satisfies (1·1).

scholarly journals Construction and Determination of Irreducible Polynomials in Galois elds, GF(2m)

2019 ◽  
pp. 1-6
Author(s):  
Abraham Aidoo ◽  
Kwasi Baah Gyam ◽  
Fengfan Yang
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Monic Polynomial ◽  
Galois Field ◽  
Irreducible Polynomials ◽  
Primitive Polynomials

This work is about Construction of Irreducible Polynomials in Finite fields. We defined some terms in the Galois field that led us to the construction of the polynomials in the GF(2m). We discussed the following in the text; irreducible polynomials, monic polynomial, primitive polynomials, eld, Galois eld or nite elds, and the order of a finite field. We found all the polynomials in $$F_2[x]$$ that is, $$P(x) =\sum_{i=1}^m a_ix^i : a_i \in F_2$$ with $$a_m \neq 0$$ for some degree $m$ whichled us to determine the number of irreducible polynomials generally at any degree in $$F_2[x]$$.

scholarly journals Further Arithmetical Functions in Finite Fields

1969 ◽  
Vol 16 (4) ◽  
pp. 349-363 ◽  
Author(s):  
Stephen D. Cohen
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Ordered Set ◽  
Equivalence Classes ◽  
Irreducible Polynomials ◽  
Arithmetical Functions ◽  
Image Position

In this paper, the author continues his investigation, initiated in (4) and (5), into the nature of certain “arithmetical” functions associated with the factorisation of normalised non-zero polynomials in the ring GF[q, X1, …, Xk], where k ≧ 1, GF(q) is the finite field of order q and X1, …, Xk are indeterminates. By normalised polynomials we mean that exactly one polynomial has been selected from equivalence classes with respect to multiplication by non-zero elements of GF(q). With this normalisation GF[q, X1, …, Xk] becomes a unique factorisation domain. The constant polynomial will be denoted by 1. By the degree of a polynomial A in GF[q, X1, …, Xk], we shall mean the ordered set (m1, …, mk), where mi is the degree of A in Xi, 1 ≦ i ≦.k. We shall assume that A(≠ 1), a typical polynomial in GF[q, X1, … Xk], has prime factorisationwhere P1, …, Pr are distinct irreducible polynomials (i.e. primes).

Maximal Sets of Pairwise Orthogonal Vectors in Finite Fields

2012 ◽  
Vol 55 (2) ◽  
pp. 418-423 ◽  
Author(s):  
Le Anh Vinh
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Fields ◽  
Bilinear Form ◽  
Symmetric Bilinear Form

AbstractGiven a positive integern, a finite fieldofqelements (qodd), and a non-degenerate symmetric bilinear formBon, we determine the largest possible cardinality of pairwiseB-orthogonal subsets, that is, for any two vectorsx,y∈ Ε, one hasB(x,y) = 0.

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.

scholarly journals The distribution of irreducible polynomials in several indeterminates over a finite field

1968 ◽  
Vol 16 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Stephen D. Cohen
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Equivalence Class ◽  
Ordered Set ◽  
Irreducible Polynomials ◽  
Totally Positive

We consider non-zero polynomials f(x1, …, xk) in k variables x1, …, xk with coefficients in the finite field GF[q] (q = pn for some prime p and positive integer n). We assume that the polynomials have been normalised by selecting one polynomial from each equivalence class with respect to multiplication by non-zero elements of GF[q]. By the degree of a polynomial f(x1, …, xk) will be understood the ordered set (m1, …, mk), where mi is the degree of f(x1 ,…, xk) in x1(i = 1, 2, …, K). The degree (m,…, mk) of a polynomial will be called totally positive if mi>0, i = 1, 2, …, k.

Distinct Values of a Polynomial in Subsets of a Finite Field

1969 ◽  
Vol 21 ◽  
pp. 1483-1488
Author(s):  
Kenneth S. Williams
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Number ◽  
Image Position

If A is a set with only a finite number of elements, we write |A| for the number of elements in A. Let p be a large prime and let m be a positive integer fixed independently of p. We write [pm] for the finite field with pm elements and [pm]′ for [pm] – {0}. We consider in this paper only subsets H of [pm] for which |H| = h satisfies1.1If f(x) ∈ [pm, x] we let N(f; H) denote the number of distinct values of y in H for which at least one of the roots of f(x) = y is in [pm]. We write d(d ≥ 1) for the degree of f and suppose throughout that d is fixed and that p ≧ p0(d), for some prime p0, depending only on d, which is greater than d.

scholarly journals Constructing irreducible polynomials with prescribed level curves over finite fields

2001 ◽  
Vol 27 (4) ◽  
pp. 197-200
Author(s):  
Mihai Caragiu
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Irreducible Polynomial ◽  
Irreducible Polynomials ◽  
Level Curves ◽  
Curves Over Finite Fields ◽  
Irreducibility Criterion ◽  
Absolutely Irreducible Polynomial

We use Eisenstein's irreducibility criterion to prove that there exists an absolutely irreducible polynomialP(X,Y)∈GF(q)[X,Y]with coefficients in the finite fieldGF(q)withqelements, with prescribed level curvesXc:={(x,y)∈GF(q)2|P(x,y)=c}.

EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS

2010 ◽  
Vol 82 (2) ◽  
pp. 232-239 ◽  
Author(s):  
JAIME GUTIERREZ ◽  
IGOR E. SHPARLINSKI
Keyword(s):  
Dynamical Systems ◽  
Lower Bound ◽  
Finite Field ◽  
Rational Function ◽  
Finite Fields ◽  
Exponential Sums ◽  
Short Interval ◽  
Additive Combinatorics ◽  
Distribution Of Elements ◽  
Image Position

AbstractGiven a finite field 𝔽p={0,…,p−1} of p elements, where p is a prime, we consider the distribution of elements in the orbits of a transformation ξ↦ψ(ξ) associated with a rational function ψ∈𝔽p(X). We use bounds of exponential sums to show that if N≥p1/2+ε for some fixed ε then no N distinct consecutive elements of such an orbit are contained in any short interval, improving the trivial lower bound N on the length of such intervals. In the case of linear fractional functions we use a different approach, based on some results of additive combinatorics due to Bourgain, that gives a nontrivial lower bound for essentially any admissible value of N.

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} .$

THE ITERATION DIGRAPHS OF GROUP RINGS OVER FINITE FIELDS

2014 ◽  
Vol 13 (05) ◽  
pp. 1350162 ◽  
Author(s):  
YANGJIANG WEI ◽  
GAOHUA TANG ◽  
JIZHU NAN
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Group Rings ◽  
Directed Edge ◽  
Cycle Structure ◽  
Vertex Set ◽  
Finite Commutative Ring ◽  
Necessary And Sufficient

For a finite commutative ring R and a positive integer k ≥ 2, we construct an iteration digraph G(R, k) whose vertex set is R and for which there is a directed edge from a ∈ R to b ∈ R if b = ak. In this paper, we investigate the iteration digraphs G(𝔽prCn, k) of 𝔽prCn, the group ring of a cyclic group Cn over a finite field 𝔽pr. We study the cycle structure of G(𝔽prCn, k), and explore the symmetric digraphs. Finally, we obtain necessary and sufficient conditions on 𝔽prCn and k such that G(𝔽prCn, k) is semiregular.

Sign in / Sign up

Export Citation Format

Share Document