Cycles of polynomial mappings in several variables over rings of integers in finite extensions of the rationals (Q4484415)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1927495
Language Label Description Also known as
default for all languages
No label defined
    English
    Cycles of polynomial mappings in several variables over rings of integers in finite extensions of the rationals
    scientific article; zbMATH DE number 1927495

      Statements

      Cycles of polynomial mappings in several variables over rings of integers in finite extensions of the rationals (English)
      0 references
      12 June 2003
      0 references
      polynomial maps
      0 references
      polynomial cycles
      0 references
      Hasse principle
      0 references
      0 references
      The author establishes a kind of Hasse principle for the lengths of cycles of polynomial maps in \(N\geq 2\) variables over Dedekind domains \(R\) by showing (Theorem 3.2) that there exists such a map \(R^N\longrightarrow R^N\) having a cycle of length \(k\) if and only if the same happens in all completions of \(R\) with respect to non-zero prime ideals. It is also shown that this equivalence fails in the case \(N=1\). As an application it is shown that \[ \lim_{nN\to\infty,N\geq 2}{\log B(n,N)\over nN}=\log 4, \] where \(B(n,N)=\max_{[K:Q]=n}B(Z_K,N)\), and \(B(Z_K,N)\) denotes the maximal length of a cycle of a polynomial map \(Z_K^N\longrightarrow Z_K^N\), defined over \(Z_K\), \(Z_K\) being the ring of integers of an algebraic number field \(K\). In the case of the ring \(Z\) of rational integers he proves the bounds \(4^N\ll B(Z,N)\ll 4^NN^2\) and obtains also similar bounds for rings of integers in certain families of algebraic number fields.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references