Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Cycles of polynomials in algebraically closed fields of positive characteristic

100%
2
Content available remote

Polynomial cycles in certain local domains

100%
Acta Arithmetica
|
1994
|
tom 66
|
nr 1
11-22
EN
1. Let R be a domain and f ∈ R[X] a polynomial. A k-tuple $x₀,x₁,...,x_{k-1}$ of distinct elements of R is called a cycle of f if $f(x_i) = x_{i+1}$ for i=0,1,...,k-2 and $f(x_{k-1}) = x₀$. 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 $7^{7·2^N}$, depending only on the degree N of K. In this note we consider the case when R is a discrete valuation domain of zero characteristic with finite residue field. We shall obtain an upper bound for the possible lengths of cycles in R and in the particular case R=ℤₚ (the ring of p-adic integers) we describe all possible cycle lengths. As a corollary we get an upper bound for cycle lengths in the ring of integers in an algebraic number field, which improves the bound given in [1]. The author is grateful to the referee for his suggestions, which essentially simplified the proof in Subsection 6 and improved the bound for C(p) in Theorem 1 in the case p = 2,3.
3
100%
4
100%
Open Mathematics
|
2004
|
tom 2
|
nr 2
294-331
EN
We find all possible cycle-lengths for polynomial mappings in two variables over rings of integers in quadratic extensions of rationals.
6
Content available remote

On prime values of reducible quadratic polynomials

64%
EN
It is shown that Dickson's Conjecture about primes in linear polynomials implies that if f is a reducible quadratic polynomial with integral coefficients and non-zero discriminant then for every r there exists an integer $N_r$ such that the polynomial $f(X)/N_r$ represents at least r distinct primes.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.