A matrix paraphrase of cyclotomy
Binary BBP-formulae for logarithms and generalized Gaussian-Mersenne primes.
Complete solution of the cyclotomic problem in for any prime modulus
Correction to "Minimal polynomials for Gauss periods with f=2" (Acta Arith. 121 (2006), 233-257)
Cyclotomic numbers of order 2l, l an odd prime
Cyclotomic polynomials with large coefficients
Cyclotomic properties of the Rudin-Shapiro polynomials.
Cyclotomy of order 15 over , (mod 15).
Gauss sums for Fq[T].
Gauss Sums of Cubic Characters over , p Odd
An elementary approach is shown which derives the values of the Gauss sums over , p odd, of a cubic character. New links between Gauss sums over different field extensions are shown in terms of factorizations of the Gauss sums themselves, which are then revisited in terms of prime ideal decompositions. Interestingly, one of these results gives a representation of primes p of the form 6k+1 by a binary quadratic form in integers of a subfield of the cyclotomic field of the pth roots of unity.
Jacobi sums and cyclotomic numbers for a finite field
Jacobi sums and cyclotomic numbers of order l²
Jacobi sums over finite fields
Lehmer's semi-symmetric cyclotomic sums
Lower bounds for the largest prime factor of an odd perfect number which is divisible by a Fermat prime.
Minimal polynomials for Gauss periods with f=2
Nonexistence of twentieth power residue difference sets
Note on a Cubic Character Sum.
On a Fermat Equation Arising in the Arithmetic Theory of Function Fields.
On partitions and cyclotomic polynomials.