Related papers: Unmating of rational maps, sufficient criteria and…

Gross, Mansour and Tucker introduced the partial-twuality polynomial of a ribbon graph. Chumutov and Vignes-Tourneret posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would…

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

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…

We explore when it is legal to differentiate a polynomial evaluated at a root of unity using modular arithmetic.

Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…

The Fatou-Julia iteration theory of rational functions has been extended to quasiregular mappings in higher dimension by various authors. The purpose of this paper is an analogous extension of the iteration theory of transcendental entire…

Gluing is a cut and paste construction where the dynamics of a map in a given domain is replaced by a different one, under the condition that the two agree along the gluing curve. Here we consider two polynomials with a finite…

Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension…

We compare dynamical and algebraic properties of semigroups of rational maps. In particular, we show a version of the Day-von Neumann's conjecture and give a partial positive answer to "Sushkievich's problem" for semigroups of rational…

A rational function is the ratio of two complex polynomials in one variable without common roots. Its degree is the maximum of the degrees of the numerator and the denominator. Rational functions belong to the same class if one turns into…

Relaxed Newton's method is a one-parameter family of root-finding methods that generalizes the classical Newton's method. When viewed as a rational map on the Riemann sphere, this family exhibits rich and subtle global dynamics that depend…

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…

We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.

A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. An alternative proof is presented.

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

For two positive maps $\phi_i:B(\mathcal{K}_i)\to B(\mathcal{H}_i)$, $i=1,2$, we construct a new linear map $\phi:B(\mathcal{H})\to B(\mathcal{K})$, where $\mathcal{K}=\mathcal{K}_1\oplus\mathcal{K}_2\oplus\mathbb{C}$,…

We consider proper holomorphic maps of ball complements and differences in complex euclidean spaces of dimension at least two. Such maps are always rational, which naturally leads to a related problem of classifying rational maps taking…

This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like…

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.