Related papers: On (non-)local-connectivity of some Julia sets

We prove the existence of quadratic polynomials having a Julia set with positive Lebesgue measure in three cases: the presence of a Cremer fixed point, the presence of a Siegel disk, the presence of infinitely many (satellite)…

Laminations are a combinatorial and topological way to study Julia sets. Laminations give information about the structure of parameter space of degree $d$ polynomials with connected Julia sets. We first study fixed point portraits in…

In this article, we introduce the concept of normal families of bicomplex holomorphic functions to obtain a bicomplex Montel theorem. Moreover, we give a general definition of Fatou and Julia sets for bicomplex polynomials and we obtain a…

We give an alternative way to construct an entire function with quasiconformal surgery so that all its Fatou components are quasi-circles but the Julia set is non-locally connected.

We study loop near-rings, a generalization of near-rings, where the additive structure is not necessarily associative. We introduce local loop near-rings and prove a useful detection principle for localness.

It is shown that for quasiregular maps of positive lower order the Julia set coincides with the boundary of the fast escaping set.

We introduce a fundamental concept -- closed sets of correlations -- for studying non-local correlations. We argue that sets of correlations corresponding to information-theoretic principles, or more generally to consistent physical…

In this article, we study the global dynamics of Halley's method applied to complex polynomials. Specifically, we analyze the structure and connectivity of the Julia set of this method. The convergence behavior, symmetry properties, and…

We study the functional equation $A\circ X=X\circ B$, where $A,$ $B$, and $X$ are polynomials over $\mathbb C$. Using previous results of the author about polynomials sharing preimages of compact sets, we show that for given $B$ its…

This paper investigates the interplay between local and global equivalences on noncommutative polynomials, the elements of the free algebra. When the latter are viewed as functions in several matrix variables, a local equivalence of…

For a non-commutative ring R, we consider factorizations of polynomials in R[t] where t is a central variable. A pseudo-root of a polynomial p(t) is an element x in R, for which there exist polynomials q(t) and s(t) such that…

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…

We show the existence of polynomial maps which have a regular bifurcation value, while over a neighbourhood of this value the fibres are connected and diffeomorphic.

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…

Flat connections induced over covering maps are studied and the trivial ones among them are described. In the sequel, we deal with the resulting holonomy bundles.

We study the approximation of conformal mappings with the polynomials defined by Keldysh and Lavrentiev from an extremal problem considered by Julia. These polynomials converge uniformly on the closure of any Smirnov domain to the conformal…

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…

We prove that several dynamically defined fractals in $\mathbb{C}$ and $\mathbb{C}^2$ which arise from different type of polynomial dynamical systems can not be the same objects. One of our main results is that the closure of Misiurewicz…

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