Polynomials with minimal value set over Galois rings.
Primitive free quartics with specified norm and trace
Primitive quadratics reflected in -sequences.
Primitive roots and powers among values of polynomials over finite fields.
Quadratic forms with polynomial coefficients
Quasi-permutation polynomials
A quasi-permutation polynomial is a polynomial which is a bijection from one subset of a finite field onto another with the same number of elements. This is a natural generalization of the familiar permutation polynomials. Basic properties of quasi-permutation polynomials are derived. General criteria for a quasi-permutation polynomial extending the well-known Hermite's criterion for permutation polynomials as well as a number of other criteria depending on the permuted domain and range are established....
Rational Functions with Partial Quotients of Small Degree in Their Continued Fraction Expansion.
Rechnen in endlichen Körpern (Beispiele elementarer Zahlentheorie).
Rédei-Permutationen auf Restklassenringen Z/(m).
Reguläre Polynome über endlichen Körpern
Répartition modulo 1 dans un corps de séries formelles sur un corps fini [Book]
Répartition modulo 1 dans un corps de séries formelles sur un corps fini
Introduction. Soit q une puissance d’un nombre premier p et soit le corps fini à q éléments. Une certaine analogie entre l’arithmétique de l’anneau ℤ des entiers rationnels et celle de l’anneau a conduit à étendre à de nombreuses questions de l’arithmétique classique. L’équirépartition modulo 1 est une de ces questions. Le corps des nombres réels est alors remplacé par le corps des séries de Laurent formelles, complété du corps des fractions rationnelles pour la valuation à l’infini et...
Self-reciprocal polynomials over finite fields.
Sequences of reducible -polynomials modulo a prime.
Solving quadratic equations over polynomial rings of characteristic two.
We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A.We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction, we obtain a finite algorithm for solving a polynomial equation over A when A is F[x1, ..., xN] or F(x1,...
Some generalisations of Chebyshev polynomials and their induced group structure over a finite field
Sommes de carrés dans [Book]
Sommes de carrés de polynômes irréductibles dans
Sommes de carrés et d’irréductibles dans
Sommes de cubes dans l’anneau