相关论文: Unmating of expanding Thurston maps with Julia set…
We establish a principle that we call the Fatou-Shishikura injection for Newton maps of polynomials: there is a dynamically natural injection from the set of non-repelling periodic orbits of any Newton map to the set of its critical orbits.…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
We show that a strengthened version of the Collet-Eckmann condition for multimodal maps is topologically invariant. In particular, if f is non-uniformly expanding and the critical points are generic with respect to the absolutely continuous…
A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be \emph{immediately renormalizable} if there exists a (connected) quadratic-like invariant filled Julia set $K^*$ such that $b\in K^*$. In that case exactly one…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
We show that in any family of stunted sawtooth maps, the set of maps whose set of periods is the set of all powers of 2 has no interior point, i.e., the combinatorial description of the boundary of chaos coincides with the topological…
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…
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…
Finding a maximum cardinality common independent set in two matroids (also known as \textsc{Matroid Intersection}) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum…
In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…
We prove that for every smooth Jordan curve $\gamma \subset \mathbb{C}$ and for every set $Q \subset \mathbb{C}$ of six concyclic points, there exists a non-constant quadratic polynomial $p \in \mathbb{C}[z]$ such that $p(Q) \subset…
This paper contains an attempt to formulate rigorously and to check predictions in enumerative geometry of curves following from Mirror Symmetry. The main tool is a new notion of stable map. We give an outline of a contsruction of…
We consider the thermodynamic formalism of a complex rational map $f$ of degree at least two, viewed as a dynamical system acting on the Riemann sphere. More precisely, for a real parameter $t$ we study the (non-)existence of equilibrium…
We propose a systematic approach to the construction of invariant union of polytopes (IUP) in expanding piecewise affine mappings whose linear components are isotropic scalings. The approach relies on using empirical information embedded in…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…
We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…
We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…