Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMinimality of $5$-adic polynomial dynamical systems
93
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We characterize the dynamical systems consisting of the set of 5-adic integers and polynomial maps which consist of only one minimal component.
rate research
Read More
A rational map with good reduction in the field $mathbb{Q}_p$ of $p$-adic numbers defines a $1$-Lipschitz dynamical system on the projective line $mathbb{P}^1(mathbb{Q}_p)$ over $mathbb{Q}_p$. The dynamical structure of such a system is completely described by a minimal decomposition. That is to say, $mathbb{P}^1(mathbb{Q}_p)$ is decomposed into three parts: finitely many periodic orbits; finite or countably many minimal subsystems each consisting of a finite union of balls; and the attracting basins of periodic orbits and minimal subsystems. For any prime $p$, a criterion of minimality for rational maps with good reduction is obtained. When $p=2$, a condition in terms of the coefficients of the rational map is proved to be necessary for the map being minimal and having good reduction, and sufficient for the map being minimal and $1$-Lipschitz. It is also proved that a rational map having good reduction of degree $2$, $3$ and $4$ can never be minimal on the whole space $mathbb{P}^1(mathbb{Q}_2)$.
Monomial mappings, $xmapsto x^n$, are topologically transitive and ergodic with respect to Haar measure on the unit circle in the complex plane. In this paper we obtain an anologous result for monomial dynamical systems over $p-$adic numbers. The process is, however, not straightforward. The result will depend on the natural number $n$. Moreover, in the $p-$adic case we never have ergodicity on the unit circle, but on the circles around the point 1.
We describe the set of all $(3,1)$-rational functions given on the set of complex $p$-adic field $mathbb C_p$ and having a unique fixed point. We study $p$-adic dynamical systems generated by such $(3,1)$-rational functions and show that the fixed point is indifferent and therefore the convergence of the trajectories is not the typical case for the dynamical systems. We obtain Siegel disks of these dynamical systems. Moreover an upper bound for the set of limit points of each trajectory is given. For each $(3,1)$-rational function on $mathbb C_p$ there is a point $hat x=hat x(f)in mathbb C_p$ which is zero in its denominator. We give explicit formulas of radii of spheres (with the center at the fixed point) containing some points that the trajectories (under actions of $f$) of the points after a finite step come to $hat x$. For a class of $(3,1)$-rational functions defined on the set of $p$-adic numbers $mathbb Q_p$ we study ergodicity properties of the corresponding dynamical systems. We show that if $pgeq 3$ then the $p$-adic dynamical system reduced on each invariant sphere is not ergodic with respect to Haar measure. For $p=2$, under some conditions we prove non ergodicity and show that there exists a sphere on which the dynamical system is ergodic. Finally, we give a characterization of periodic orbits and some uniformly local properties of the $(3.1)-$rational functions.
We consider a family of $(2,1)$-rational functions given on the set of $p$-adic field $Q_p$. Each such function has a unique fixed point. We study ergodicity properties of the dynamical systems generated by $(2,1)$-rational functions. For each such function we describe all possible invariant spheres. We characterize ergodicity of each $p$-adic dynamical system with respect to Haar measure reduced on each invariant sphere. In particular, we found an invariant spheres on which the dynamical system is ergodic and on all other invariant spheres the dynamical systems are not ergodic.
In the study of reaction networks and the polynomial dynamical systems that they generate, special classes of networks with important properties have been identified. These include reversible, weakly reversible}, and, more recently, endotactic networks. While some inclusions between these network types are clear, such as the fact that all reversible networks are weakly reversible, other relationships are more complicated. Adding to this complexity is the possibility that inclusions be at the level of the dynamical systems generated by the networks rather than at the level of the networks themselves. We completely characterize the inclusions between reversible, weakly reversible, endotactic, and strongly endotactic network, as well as other less well studied network types. In particular, we show that every strongly endotactic network in two dimensions can be generated by an extremally weakly reversible network. We also introduce a new class of source-only networks, which is a computationally convenient property for networks to have, and show how this class relates to the above mentioned network types.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
