Sciweavers

Share
FFA
2010
84views more  FFA 2010»
9 years 1 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
MOC
2000
97views more  MOC 2000»
9 years 2 months ago
Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers
Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...
F. Thaine
ACL2
2006
ACM
9 years 8 months ago
Unique factorization in ACL2: Euclidean domains
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
John R. Cowles, Ruben Gamboa
books