Related papers: Bicritical rational maps with a common iterate

Let $S$ be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm that provides three rational maps $f,g,h:\mathbb{A}^2 --\to…

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

In this paper we study homeomorphisms of the circle with several critical points and bounded type rotation number. We prove complex a priori bounds for these maps. As an application, we get that bi-cubic circle maps with same bounded type…

Let E be an H-space acting on a based space X. Then we refer to ev: E -> X, the map obtained by acting on the base point of X, as a ``generalized evaluation map." We establish several fundamental results about the rational homotopy…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

The purpose of this note is to give a short, selfcontained proof of the following result: A complex surface which is diffeomeorphic to a rational surface is rational.

We study periodicity conditions of a rational map on $\bm{C}^d$ with $p$ invariants and show that a set of isolated periodic points and an algebraic variety of finife dimension do not exist in one map simultaneously if $p\ge d/2$. We also…

In the early 1980's Thurston gave a topological characterization of rational maps whose critical points have finite iterated orbits (\cite{Th,DH1}): given a topological branched covering $F$ of the two sphere with finite critical orbits, if…

In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 -…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

Let $f$ and $g$ be two H\'enon-Sibony maps of $\mathbb{C}^k$. We show that if they have the same forward Julia set, then they share a common iterate, thereby extending Lamy's results from dimension 2.

Let $K$ be a number field, and $\varphi_{1},\ldots,\varphi_{g}\in K(t)$ be finitely many rational maps, each of degree at least $2$. We first show that for generic finite sets $\mathcal{A}_{1},\ldots,\mathcal{A}_{g}$ consisting entirely of…

The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$…

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Motivic equivalence for algebraic groups was recently introduced in [9], where a characterization of motivic equivalent groups in terms of higher Tits indexes is given. As a consequence, if the quadrics associated to two quadratic forms…

Let a cluster be a term with a number of patterns occurring in it. We give two accounts of clusters, a geometric one as sets of (node and edge) positions, and an inductive one as pairs of terms with gaps (2nd order variables) and…

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are…

Let $\core G$ and $\corona G$ denote the intersection and the union, respectively, of all maximum independent sets of a graph $G$. A graph is called \emph{$2$-bicritical} if $\a{N(S)}>\a S$ for every nonempty independent set $S$.…

Let $d\geq 2$ be an integer and let $\omega_1,\cdots ,\omega_d$ be moduli of continuity in a specified class which contains the moduli of H\"{o}lder continuity. Let $f_k$, $k\in\{1,\cdots,d\}$, be $C^{1+\omega_k}$ orientation preserving…