A numerical scheme using multi-shockpeakons to compute solutions of the Degasperis-Procesi equation.
In this note, we consider the question of local analytic equivalence of analytic functions which fix the origin and are tangent to the identity. All mappings and equivalences are considered in the non-archimedean context e.g. all norms can be considered -adic norms. We show that any two mappings and which are formally equivalent are also analytically equivalent. We consider the related questions of roots and centralizers for analytic mappings. In this setting, anything which can be done formally...
We study dynamical systems in the non-Archimedean number fields (i.e. fields with non-Archimedean valuation). The main results are obtained for the fields of p-adic numbers and complex p-adic numbers. Already the simplest p-adic dynamical systems have a very rich structure. There exist attractors, Siegel disks and cycles. There also appear new structures such as fuzzy cycles. A prime number p plays the role of parameter of a dynamical system. The behavior of the iterations depends on this parameter...
We prove that if an n×n matrix defined over ℚ ₚ (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruence property, then it has a strictly maximal eigenvalue in ℚ ₚ, and that iteration of the (normalized) matrix converges to a projection operator onto the corresponding eigenspace. This result may be viewed as a p-adic analogue of the Perron-Frobenius theorem for positive real matrices.
In a recent preprint [B], Bergweiler relates the number of critical points contained in the immediate basin of a multiple fixed point β of a rational map f: ℙ¹ → ℙ¹, the number N of attracting petals and the residue ι(f,β) of the 1-form dz/(z-f(z)) at β. In this article, we present a different approach to the same problem, which we were developing independently at the same time. We apply our method to answer a question raised by Bergweiler. In particular, we prove that when there are only...
We describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions which are unique) for every input accepted by the automaton. Therefore, pseudo-minimal DTA...
In the paper [CEGHM] a polynomial counterexample to the Markus-Yamabe Conjecture and to the discrete Markus-Yamabe Question in dimension n ≥ 3 are given. In the present paper we explain a way for obtaining a family of polynomial counterexamples containing the above ones. Finally we study the global dynamics of the examples given in [CEGHM].
A decoration of the Mandelbrot set is a part of cut off by two external rays landing at some tip of a satellite copy of attached to the main cardioid. In this paper we consider infinitely renormalizable quadratic polynomials satisfying the decoration condition, which means that the combinatorics of the renormalization operators involved is selected from a finite family of decorations. For this class of maps we provea priori bounds. They imply local connectivity of the corresponding Julia sets...
We give an alternative proof of simultaneous linearization recently shown by T. Ueda, which connects the Schröder equation and the Abel equation analytically. In fact, we generalize Ueda's original result so that we may apply it to the parabolic fixed points with multiple petals. As an application, we show a continuity result on linearizing coordinates in complex dynamics.