相关论文: Parabolic Julia Sets are Polynomial Time Computabl…
We develop a theory of quasisymmetries for finitely ramified fractals, with applications to finitely ramified Julia sets. We prove that certain finitely ramified fractals admit a naturally defined class of "undistorted metrics" that are all…
We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…
We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…
We build measurable holomorphic motions for Julia sets of holomorphic families of endomorphisms of CP(k) under various equivalent notions of stability.
The dynamics of all quadratic Newton maps of rational functions are completely described. The Julia set of such a map is found to be either a Jordan curve or totally disconnected. It is proved that no Newton map with degree at least three…
We show that the iterative logarithm of each non-linear entire function is differentially transcendental over the ring of entire functions, and we give a sufficient criterion for such an iterative logarithm to be differentially…
We study the functional equation $A\circ X=X\circ B$, where $A,$ $B$, and $X$ are polynomials over $\mathbb C$. Using previous results of the author about polynomials sharing preimages of compact sets, we show that for given $B$ its…
Let X be a smooth curve defined over the algebraic numbers, let a,b be algebraic numbers, and let f_l(x) be an algebraic family of rational maps indexed by all l in X. We study whether there exist infinitely many l in X such that both a and…
Let $f$ and $g$ be two quasiregular maps in $\mathbb{R}^d$ that are of transcendental type and also satisfy $f\circ g =g \circ f$. We show that if the fast escaping sets of those functions are contained in their respective Julia sets then…
Recently, the place of the main programming language for scientific and engineering computations has been little by little taken by Julia. Some users want to work completely within the Julia framework as they work within the Python…
In this paper we present a system of two nonlinear partial differential equations of the second order, depending on the time and one spatial coordinate. It can be written as a system of two Burgers equations, which allows one to immediately…
Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…
Brjuno and R\"ussmann proved that every irrationally indifferent fixed point of an analytic function with a Brjuno rotation number is linearizable, and Yoccoz proved that this is sharp for quadratic polynomials. Douady conjectured that this…
We propose the first linear-time algorithm to compute the conjugate of (nonconvex) bivariate piecewise linear-quadratic (PLQ) functions (bivariate quadratic functions defined on a polyhedral subdivision). Our algorithm starts with computing…
We investigate under which dynamical conditions the Julia set of a quadratic rational map is a Sierpi\'{n}ski curve
We prove the interior null-controllability of one-dimensional parabolic equations with time independent measurable coefficients.
For a rational function $R$, let $N_R(z)=z-\frac{R(z)}{R'(z)}.$ Any such $N_R$ is referred to as a Newton map. We determine all the rational functions $R$ for which $N_R$ has exactly two attracting fixed points, one of which is an…
We consider a notion of rationalizability, where the rationalizing relation may depend on the set of feasible alternatives. More precisely, we say that a choice function is locally rationalizable if it is rationalized by a family of…
We consider the space of degree $n\ge 2$ rational maps of the Riemann sphere with $k$ distinct marked periodic orbits of given periods. First, we show that this space is irreducible. For $k=2n-2$ and with some mild restrictions on the…
We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…