Related papers: Unicritical polynomial maps with rational multipli…

We first show the existence of an effective determinantal representation for any univariate polynomial with real coefficients. Then, we more precisely establish that any univariate polynomial with real coefficients has an effective…

We generalize a preceding simple proof of the Jamiolkowski criterion to check whether a given linear map between algebras of operators is completely positive or not. The generalization is performed to embrace all algebras of Hilbert-Schmidt…

The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of…

We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…

The aims of this paper are to answer several conjectures and questions about multiplier spectrum of rational maps and to give new proofs of several rigidity theorems in complex dynamics, by combining tools from complex and non-archimedean…

Given a number field $\mathbb{K} \subset \mathbb{C}$ that is not contained in $\mathbb{R}$, we prove the existence of a dense set of entire maps $f \colon \mathbb{C} \rightarrow \mathbb{C}$ whose preperiodic points and multipliers all lie…

This paper deals with holomorphic self-maps of the complex projective plane and the algebraic relations among the eigenvalues of the derivatives at the fixed points. These eigenvalues are constrained by certain index theorems such as the…

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…

We prove that every bounded type Siegel disk of a rational map must be a quasi-disk with at least one critical point on its boundary. This verifies Douady-Sullivan conjecture for bounded type Siegel disks.

Let p be a polynomial in one complex variable. Smale's mean value conjecture estimates |p'(z)| in terms of the gradient of a chord from (z, p(z)) to some stationary point on the graph of $p$. The conjecture does not immediately generalise…

We classify two-variable polynomials which are rational of simple type. These are precisely the two-variable polynomials with trivial homological monodromy.

In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…

In this article, we consider a counting problem for orbits of hyperbolic rational maps on the Riemann sphere, where constraints are placed on the multipliers of orbits. Using arguments from work of Dolgopyat, we consider varying and…

Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…

A simple matrix formulation of the Fibonacci, Lucas, Chebyshev, and Dixon polynomials polynomials is presented. It utilizes the powers and the symmetric tensor powers of a certain matrix.

Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated \textit{functional graph}…

It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical…