Related papers: Unicritical polynomial maps with rational multipli…
McMullen proved the moduli space of complex rational maps can be parametrized by the spectrum of all periodic-point multipliers up to a finite amount of data, with the well-understood exception of Latt\`{e}s maps. We generalize his method…
Every affine Weyl group appears as the iterated monodromy group of a Chebyshev-like polynomial self-map of $\mathbb{C}^n$.
We prove for a tropical rational map that if for any point the convex hull of Jacobian matrices at smooth points in a neighborhood of the point does not contain singular matrices then the map is an isomorphism. We also show that a tropical…
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
Douady and Hubbard introduced the operation of mating of polynomials. This identifies two filled Julia sets and the dynamics on them via external rays. In many cases one obtains a rational map. Here the opposite question is tackled. Namely…
This note defines a family of Laurent polynomials (indexed in the rational projective line) which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each…
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…
The postcritical set $P(f)$ of a rational map $f:\mathbb P^1\to \mathbb P^1$ is the smallest forward invariant subset of $\mathbb P^1$ that contains the critical values of $f$. In this paper we show that every finite set $X\subset \mathbb…
We obtain a unique, canonical one-to-one correspondence between the space of marked postcritically finite Newton maps of polynomials and the space of postcritically minimal Newton maps of entire maps that take the form $p(z)…
We extend Thurston's combinatorial criterion for postcritically finite rational maps to a class of rational maps with bounded type Siegel disks. The combinatorial characterization of this class of Siegel rational maps plays a special role…
We are concerned with the behavior of the polynomial maps $F=(P,Q)$ of $\mathbb{C}^2$ with finite fibres and satisfying the condition that all of the curves $aP+bQ=0$, $(a:b)\in \mathbb{P}^1$, are irreducible rational curves. The obtained…
We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…
Let $k$ be a number field with algebraic closure $\bar{k}$, and let $S$ be a finite set of places of $k$ containing all the archimedean ones. Fix $d\geq 2$ and $\alpha \in \bar{k}$ such that the map $z\mapsto z^d+\alpha$ is not…
The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…
A finite unary algebra $(A,F)$ has only countably many countable subdirect powers if and only if every operation $f\in F$ is either a permutation or a constant mapping.
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…
We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…