Related papers: Constructing rational maps with cluster points usi…

The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations…

Every expanding Thurston map $f$ without periodic critical points is known to have an iterate $f^n$ which is the topological mating of two polynomials. This has been examined by Kameyama and Meyer; the latter who has offered an explicit…

Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

For typical cocycles over subshifts of finite type, we show that for any given orbit segment, we can construct a periodic orbit such that it shadows the given orbit segment and that the product of the cocycle along its orbit is a proximal…

Given a polynomial or a rational map f we associate to it a space of maps. We introduce local coordinates in this space, which are essentially the set of critical values of the map. Then we consider an arbitrary periodic orbit of f with…

For each integer $m \geq 1$, we construct a finite-dimensional family of rational maps, given by Blaschke-type products, whose restriction to the unit circle consists of $2m$-multimodal maps. We show that every post-critically finite…

Let phi and psi be endomorphisms of the projective line of degree at least 2, defined over a noetherian commutative ring R with unity. From a dynamical perspective, a significant question is to determine whether phi and psi are conjugate…

In a recent work, we constructed a rational map from a simple Lie group $\mathcal G$ to itself that intertwines the standard Poisson--Lie structure on $\mathcal G$ with a Poisson homogeneous one defined by a pair of quasi-triangular…

This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…

{\it Fold maps} are fundamental tools in generalizing the theory of Morse functions and its application to studies of geometric properties of manifolds. One of the fundamental and important problems in the theory of fold maps is to…

In the classical context of robotic mapping and localization, map matching is typically defined as the task of finding a rigid transformation (i.e., 3DOF rotation/translation on the 2D moving plane) that aligns the query and reference maps…

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

In this work we present an algorithm with which any arbitrary cubic planar map may be constructed through successive edge insertion while simultaneously constructing a set of proper edge labels and Hamiltonian cycles for each configuration.…