Cycles of polynomial mappings in several variables over discrete valuation rings and over \(\mathbb Z\) (Q2346062)

For an integral domain \(R\) and a positive integer \(N\) let \(\mathrm{Cycl}(R,N)\) be the set of cycle-lengths of maps \(R^N\longrightarrow R^N\) defined by polynomials with coefficients in \(R\). The author gives (Theorem 1) an explicit description of this set in the case when \(R\) is an unramified discrete valuation domain with prime ideal \(P\) and \(R/P\) isomorphic to \(\mathbb{F}_p\), the finite field of \(p^f\) elements (for example \(R\) can be the ring of integers of an unramified extension of some \(p\)-adic field). This has been obtained earlier in the case \(N=1\) by the author [Acta Arith. 66, No. 1, 11--22 (1994; Zbl 0803.11063)] and by \textit{M. Zieve} [Cycles of polynomial mappings. Ph.D.thesis, Berkeley (1996)]. It turns out that the set \(\mathrm{Cycl}(R,N)\) depends only on \(f\), \(N\) and the prime \(p\). It follows from an earlier result of the author (Proposition 3.5 in [Cent. Eur. J. Math. 2, No. 2, 294--331 (2004; Zbl 1126.11057)]) that this fails for ramified \(R\) already in the case \(p=2\), \(f=1\), \(N=2\). In Theorem 2 the case of Dedekind domains \(D\) of characteristic \(0\) having ast least one prime ideal with finite norm is considered, and it is shown that if \(N\geq2\), \(m\) denotes the smallest norm of a prime ideal of \(D\) and for all prime ideals \(P\) with \(N(P)<m^2\) the local rings \(D_P\) are unramified, then Theorem 1 and the Hasse principle for cycle lengths established by the author in 2003 (Theorem 3.2 in [Acta Arith. 108, No. 2, 127--146 (2003; Zbl 1020.11066)]) can be used to determine the set \(\mathrm{Cycl}(D,N)\). This is illustrated by two examples: the set \(\mathrm{Cycl}(Z,3)\) coincides with the set of positive divisors of the numbers \(40\), \(60\), \(64\), \(72\), \(84\), \(96\) and \(112\), and the set \(\mathrm{Cycl}(D,3) \), where \(D\) is the ring of integers of the field \(Q(\sqrt{37})\) coincides with the set of all positive divisors of \(29\) explicitly listed integers, the largest being \(702\). These results are not applicable in the case \(N=1\), as in this case the Hasse principle fails. Recently the author provided an algorithm [Publ. Math. 84, No. 3--4, 399--414 (2014; Zbl 1324.11061)] to determine the set \(\mathrm{Cycl}(R,1)\) in the case when \(R\) is the ring of integers of a finite extension of the rationals.