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

Recursively enumerable sets of polynomials over a finite field are Diophantine

โœ Scribed by Jeroen Demeyer


Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
267 KB
Volume
170
Category
Article
ISSN
0020-9910

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Enumeration of Special Sets of Polynomia
โœ Astrid Reifegerste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 379 KB

In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These in

On Value Sets of Polynomials over a Fini
โœ 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

A Class of Polynomials over Finite Field
โœ 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.