Related papers: Fekete polynomials and shapes of Julia sets

Let $E\subset\Bbb{C}$ be a compact set symmetric with respect to the real axis. A classical theorem of Fekete-Szeg\H{o} asserts that such a compact set is of logarithmic capacity at least one if and only if it admits approximation by…

We revisit the approximation of nonempty compact planar sets by filled-in Julia sets of polynomials developed by Lindsey and Younsi and analyze the rate of approximation. We use slightly modified fundamental Lagrange interpolation…

A classical result of Fekete gives necessary conditions on a compact set in the complex plane so that it contains infinitely many sets of conjugate algebraic integers. For such sets, we demonstrate the existence of a sequence of algebraic…

We investigate the dynamics of semigroups generated by a family of polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. The Julia set of such a semigroup may not be connected in general. We…

Any Jordan curve in the complex plane can be approximated arbitrarily well in the Hausdorff topology by Julia sets of polynomials. Finite collections of disjoint Jordan domains can be approximated by the basins of attraction of rational…

Any finite union of disjoint, mutually exterior Jordan curves in the complex plane can be approximated arbitrarily well in the Hausdorff topology by polynomial Julia sets. Furthermore, the proof is constructive.

We show that if a polynomial filled Julia set has empty interior, then it is computable.

In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…

In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a…

Let $P$ be a polynomial with a connected Julia set $J$. We use continuum theory to show that it admits a \emph{finest monotone map $\ph$ onto a locally connected continuum $J_{\sim_P}$}, i.e. a monotone map $\ph:J\to J_{\sim_P}$ such that…

For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials $\{P_n\}$ to properties of the support. More precisely we relate the Julia…

Any planar shape $P\subset \mathbb{C}$ can be embedded isometrically as part of the boundary surface $S$ of a convex subset of $\mathbb{R}^3$ such that $\partial P$ supports the positive curvature of $S$. The complement $Q = S \setminus P$…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…

Let $X$ be an analytic subset of $U\times C^n$ of pure dimension $k$ such that the projection of $X$ onto $U$ is a proper mapping, where $U$ is a Runge domain in $C^k$. We show that $X$ can be approximated by algebraic sets.

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

We show that any compact, connected set $K$ in the plane can be approximated by the critical points of a polynomial with two critical values. Equivalently, $K$ can be approximated in the Hausdorff metric by a true tree in the sense of…

We study the possible Hausdorff limits of the Julia sets and filled Julia sets of subsequences of the sequence of dual Chebyshev polynomials of a non-polar compact set K in C and compare such limits to K. Moreover, we prove that the…

Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…

Let $f$ be a rational map with degree $d\geq 2$ whose Julia set is connected but not equal to the whole Riemann sphere. It is proved that there exists a rational map $g$ such that $g$ contains a buried Julia component on which the dynamics…