相关论文: Unmating of expanding Thurston maps with Julia set…
For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…
We provide a natural canonical decomposition of postcritically finite rational maps with non-empty Fatou sets based on the topological structure of their Julia sets. The building blocks of this decomposition are maps where all Fatou…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
The Fatou-Julia theory for rational functions has been extended both to transcendental meromorphic functions and more recently to several different types of quasiregular mappings in higher dimensions. We extend the iterative theory to…
The weighted $\mathcal{T}$-free $2$-matching problem is the following problem: given an undirected graph $G$, a weight function on its edge set, and a set $\mathcal{T}$ of triangles in $G$, find a maximum weight $2$-matching containing no…
The key result of this article is key lemma: if a Jordan curve $\gamma$ is invariant by a given C 1+$\alpha$ -diffeomorphism f of a surface and if $\gamma$ carries an ergodic hyperbolic probability $\mu$, then $\mu$ is supported on a…
Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…
In 1980s, Thurston established a topological characterization theorem for postcritically finite rational maps. In this paper, a decomposition theorem for a class of postcritically infinite branched covering termed `Herman map' is developed.…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We investigate the dynamics of semigroups generated by polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. Moreover, we investigate the associated random dynamics of polynomials.…
We study rational self-maps of $\mathbb{P}^{1}$ whose critical points all have finite forward orbit. Thurston's rigidity theorem states that outside a single well-understood family, there are finitely many such maps over $\mathbb{C}$ of…
We present in this short note a polynomial graph extension procedure that can be used to improve any graph isomorphism algorithm. This construction propagates new constraints from the isomorphism constraints of the input graphs (denoted by…
We consider postcritically finite rational maps $f\colon \widehat{\mathbb{C}} \to \widehat{\mathbb{C}}$ whose Julia set is the whole Riemann sphere $\widehat{\mathbb{C}}$. We call such a map an expanding rational Thurston map. Identifying…
The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
We solve the loop equations of the hermitian 2-matrix model to all orders in the topological $1/N^2$ expansion, i.e. we obtain all non-mixed correlation functions, in terms of residues on an algebraic curve. We give two representations of…
We consider the monodromy at infinity and the monodromies around the bifurcation points of polynomial functions $f : \CC^n \longrightarrow \CC$ which are not tame and might have non-isolated singularities. Our description of their Jordan…
In this paper we explore by means of the method of Lagrangian descriptors the Julia sets arising from complex maps, and we analyze their underlying dynamics. In particular, we take a look at two classical examples: the quadratic mapping…
In this paper we address the problem of computing $\text{deg}(f^n)$, the degrees of iterates of a birational map $f:\mathbb{P}^N\rightarrow\mathbb{P}^N$. For this goal, we develop a method based on two main ingredients: the factorization of…