×

zbMATH — the first resource for mathematics

Polynomial cycles in finite extension fields. (English) Zbl 1028.11014
Let \(K/F\) be an algebraic field extension. The authors characterize finite orbits of polynomial mappings of \(K\) which are induced by polynomials over \(F\). As an application they determine all possible cycle lengths of such orbits in the case of a finite field \(F\).

MSC:
11C08 Polynomials in number theory
11T06 Polynomials over finite fields
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] DIVIŠOVÁ Z.: On cycles of polynomials with integral rational coefficients. Math. Slovaca 52 (2002), 537-540. · Zbl 1028.11064
[2] HALTER-KOCH F.-NARKIEWICZ W.: Scarcity of finite polynomial orbits. Publ. Math. Debrecen 56 (2000), 405-414. · Zbl 0961.11005
[3] KOSTRA J.: On orbits in ambiguous ideals. Acta Acad. Paed. Agriensis, Sect. Math. 29 (2002) · Zbl 1017.11012
[4] LANG S.: Algebra. Addison-Wesley, New York, 1993. · Zbl 0848.13001
[5] LIDL R.-NIEDERREITER H.: Finite Fields. Encyclopedia of Mathematics and its Applications 20, Cambridge University Press, Cambridge, 1997.
[6] NARKIEWICZ W.: Polynomial Mappings. Lecture Notes in Mathematics 1600, Springer, New York, 1995. · Zbl 0829.11002
[7] NARKIEWICZ W.: Arithmetics of dynamical systems: A survey. Tatra Mt. Math. Publ. 11 (1997), 69-75. · Zbl 0978.11008
[8] NARKIEWICZ W.: Finite polynomial orbits: A survey. Algebraic Number Theory and Diophantine Analysis. (F. Halter-Koch, R. Tichy, Proceedings of the International Conference, Graz, Austria, August 30-September, Walter de Gruyter, Berlin, 2000, pp. 331-338. · Zbl 0971.11008
[9] NARKIEWICZ W.: Problem 9 in The Problem Session on The 3rd Czech and Polish Conference on Number Theory. Acta Math. Inform. Univ. Ostraviensis 8 (2000), 9.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.