相关论文: Computability of Julia sets

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We consider the symmetries of Julia sets of polynomial skew products on C^2, which are birationally conjugate to rotational products. Our main results give the classification of the polynomial skew products whose Julia sets have infinitely…

This article gives a precise description of the Fatou sets and Julia sets of matrix-valued polynomials in $\mathcal{M}(2,\mathbb{C})$ in terms of the corresponding polynomials in $\mathbb{C}$. Further, we construct Green functions and…

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…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

This article proposes an artistic approach to increase and enrich the understanding of Julia Sets. This approach includes the mathematical, the playful, the artistic and the computational dimensions. It is argued that these four dimensions…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…

The Fatou-Julia theory for rational functions has been extended both to transcendental meromorphic functions and more recently to several different types of quasiregular mappings in higher dimensions. We extend the iterative theory to…

We present an open source computational framework geared towards the efficient numerical investigation of open quantum systems written in the Julia programming language. Built exclusively in Julia and based on standard quantum optics…

In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power…

Every non-solvable and non-semisimple quadratic Lie algebra can be obtained as a double extension of a solvable quadratic Lie algebra. Thanks to a partial classification of nilpotent Lie algebras and this result, we can design different…

In this paper, we study the large scaled geometric structure of Julia sets of entire and meromorphic functions. Roughly speaking, the structure gives us some asymptotic information about the Julia set near the essential singularity. We will…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in…

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…

In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…

Let $f$ be a polynomial-like mapping of the sphere of degree $d \geq 2$. We show that the Julia set $J(f)$ of $f$ cannot be the union of a finite number of proper indecomposable subcontinua. As a corollary, we prove that $J(f)$ is an…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

It is shown that a polynomial with a Cremer periodic point has a non-accessible critical point in its Julia set provided that the Cremer periodic point is approximated by small cycles.