๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Number of Cycles of p-adic Dynamical Systems

โœ Scribed by Andrei Khrennikov; Marcus Nilsson

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
148 KB
Volume
90
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We found the asymptotics, p ร„ , for the number of cycles for iteration of monomial functions in the fields of p-adic numbers. This asymptotics is closely connected with classical results on the distribution of prime numbers.

๐Ÿ“œ SIMILAR VOLUMES

On the number of Hamiltonian cycles in t
On the number of Hamiltonian cycles in triangulations
โœ Jan Kratochvil; Dainis Zeps ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 2 views

It is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [21, this yields that, for n 2 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar

On the Invariant Factors of Kummer Order
On the Invariant Factors of Kummer Orders in the Rings of Integers of p-adic Number Fields of Degreep2
โœ Yoshimasa Miyata ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 356 KB

Let Kร‚k be an extension of degree p 2 over a p-adic number field k with the Galois group G. We study the Galois module structure of the ring O K of integers in K. We determine conditions under which the invariant factors of Kummer orders O K t in O K of two extensions coincide with each other and gi

On the Connectedness of Attractors for D
On the Connectedness of Attractors for Dynamical Systems
โœ Massimo Gobbino; Mirko Sardella ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 470 KB

For a dynamical system on a connected metric space X, the global attractor (when it exists) is connected provided that either the semigroup is time-continuous or X is locally connected. Moreover, there exists an example of a dynamical system on a connected metric space which admits a disconnected gl

On the multi-colored Ramsey numbers of c
On the multi-colored Ramsey numbers of cycles
โœ Tomasz ลuczak; Miklรณs Simonovits; Jozef Skokan ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 82 KB

For a graph L and an integer k โ‰ฅ 2, R k (L) denotes the smallest integer N for which for any edge-coloring of the complete graph K N by k colors there exists a color i for which the corresponding color class contains L as a subgraph.