Related papers: Realizing polynomial portraits

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

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…

We completely characterize real Bott manifolds up to affine diffeomorphism in terms of three simple matrix operations on square binary matrices obtained from strictly upper triangular matrices by permuting rows and columns simultaneously.…

Let $p \geq 2$ be a prime number and let $\mathbb{C}_p$ be the completion of an algebraic closure of the $p$-adic rational field $\mathbb{Q}_p$. Let $f_c(z)$ be a one-parameter family of rational functions of degree $d\geq 2$, where the…

Given a rational map $f:\widehat{\mathbb C}\to\widehat{\mathbb C}$ on the Riemann sphere, we define $\mathrm{Deck}(f)$ to be the group of M\"obius transformations $\mu$ satisfying $f \circ \mu = f$. In this note, we consider the groups…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

We develop techniques for using compactifications of Hurwitz spaces to study families of rational maps $\mathbb{P}^1\to\mathbb{P}^1$ defined by critical orbit relations. We apply these techniques in two settings: We show that the parameter…

Let $P\in\mathbb{P}_1(\mathbb{Q})$ be a periodic point for a monic polynomial with coefficients in $\mathbb{Z}$. With elementary techniques one sees that the minimal periodicity of $P$ is at most $2$. Recently we proved a generalization of…

A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open…

The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP by introducing a universal, graph-based…

We consider infinitely renormalizable Lorenz maps with real critical exponent $\alpha>1$ and combinatorial type which is monotone and satisfies a long return condition. For these combinatorial types we prove the existence of periodic points…

In this paper, we study hyperbolic rational maps with finitely connected Fatou sets. We construct models of post-critically finite hyperbolic tree mapping schemes for such maps, generalizing post-critically finite rational maps in the case…

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…

Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the…

We pursue the study of holomorphic Cartan geometry with singularities. We introduce the notion of logarithmic Cartan geometry on a complex manifold, with polar part supported on a normal crossing divisor. In particular, we show that the…

In recent years, there has been significant progress in the understanding of the dynamics of transcendental entire functions with bounded postsingular set. In particular, for certain classes of such functions, a complete description of…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

We classify all topological phase portraits of the polynomial generalized Li\'enard system, determined by three arbitrary polynomials, at the origin and the infinity. This yields a complete characterization of monodromy at the origin and…