The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 301 –
320 of
694
A number field , with ring of integers , is said to be a Pólya field if the -algebra formed by the integer-valued polynomials on admits a regular basis. In a first part, we focus on fields with degree less than six which are Pólya fields. It is known that a field is a Pólya field if certain characteristic ideals are principal. Analogously to the classical embedding problem, we consider the embedding of in a Pólya field. We give a positive answer to this embedding problem by showing that...
A number field , with ring of integers , is said to be a Pólya field when the -algebra formed by the integer-valued polynomials on admits a regular basis. It is known that such fields are characterized by the fact that some characteristic ideals are principal. Analogously to the classical embedding problem in a number field with class number one, when is not a Pólya field, we are interested in the embedding of in a Pólya field. We study here two notions which can be considered as measures...
By using polylogarithm series, we define “poly-Bernoulli numbers” which generalize classical Bernoulli numbers. We derive an explicit formula and a duality theorem for these numbers, together with a von Staudt-type theorem for di-Bernoulli numbers and another proof of a theorem of Vandiver.
Soit un corps et une extension quadratique de . Étant donné un polynôme de à groupe de Galois cyclique, nous donnons une méthode pour construire un polynôme de à groupe de Galois diédral, à partir des racines de . Cette méthode est tout à fait explicite : nous donnons de nombreux exemples de polynômes à groupe de Galois diédral sur le corps .
L'objet de ce texte est de donner une estimation arithmétique des valeurs prises par les polynômes de Lagrange sur les entiers d'un corps quadratique imaginaire en des points de ce corps. Ces polynômes interviennent dans l'étude des fonctions entières arithmétiques et dans les minorations de formes linéaires de Logarithmes.
It is shown that the invertible polynomial maps over a finite
field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in
the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1
it is shown that the tame subgroup of the invertible polynomial maps gives
only the even bijections, i.e. only half the bijections. As a consequence it
is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if
#S = q^(n−1).
1. Let R be a domain and f ∈ R[X] a polynomial. A k-tuple of distinct elements of R is called a cycle of f if
for i=0,1,...,k-2 and .
The number k is called the length of the cycle. A tuple is a cycle in R if it is a cycle for some f ∈ R[X].
It has been shown in [1] that if R is the ring of all algebraic integers in a finite extension K of the rationals, then the possible lengths of cycles of R-polynomials are bounded by the number , depending only on the degree N of K. In this note we consider...
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings and shall describe polynomial cycles in the case when is either odd or twice a prime.
Currently displaying 301 –
320 of
694