๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Distribution of Reciprocal Pairs Modulo Polynomials over a Finite Field

โœ Scribed by Doug Hensley

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
665 KB
Volume
184
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

Given a finite field F~q~ of order q, a fixed polynomial g in โ€“F~q~[X] of positive degree, and two elements u and v in the ring of polynomials in R = F~q~ [X]/gF~q~[X], the question arises: How many pairs (a, 6) are there in R ร— R so that ab ๏ฃฝ 1 mod g and so that a is close to u while b is close to v ? The answer is, about as many as one would expect. That is, there are no favored regions in R ร— R where inverse pairs cluster. The error term is quite sharp in most cases, being comparable to what would happen with random distribution of pairs. The proof uses Kloosterman sums and counting arguments. The exceptional cases involve fields of characteristic 2 and composite values of g. Even then the error term obtained is nontrivial. There is no computational evidence that inverses are in fact less evenly distributed in this case, however.

๐Ÿ“œ SIMILAR VOLUMES

Polynomial Distribution and Sequences of
Polynomial Distribution and Sequences of Irreducible Polynomials over Finite Fields
โœ Wun-Seng Chou; Stephen D Cohen ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 153 KB

Let k=GF(q) be the finite field of order q. Let f 1 (x), f 2 (x) # k[x] be monic relatively prime polynomials satisfying n=deg f 1 >deg f 2 0 and f 1 (x)ร‚f 2 (x){ g 1 (x p )ร‚g 2 (x p ) for any g 1 (x), g 2 (x) # k[x]. Write Q(x)= f 1 (x)+tf 2 (x) and let K be the splitting field of Q(x) over k(t). L

A Class of Polynomials over Finite Field
A Class of Polynomials over Finite Fields
โœ Arnaldo Garcia; Henning Stichtenoth ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 129 KB

Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.

The Factorization of Dickson Polynomials
The Factorization of Dickson Polynomials over Finite Fields
โœ Wun-Seng Chou ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

Let T n (x, a) สฆ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).

On Value Sets of Polynomials over a Fini
On Value Sets of Polynomials over a Finite Field
โœ Wayne Aitken ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of

Counting irreducible factors of polynomi
Counting irreducible factors of polynomials over a finite field
โœ Arnold Knopfmacher; John Knopfmacher ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 728 KB

Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i