Related papers: On computational complexity of Siegel Julia sets
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…
In this paper we explore a class of quadratic polynomials having Siegel disks with unbounded type rotation numbers. We prove that any boundary point of Siegel disks of these polynomials is a Lebesgue density point of their filled-in Julia…
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation…
We describe an algorithmic method to determine the image of restriction maps for Siegel modular forms with \textit{arbitrary} characters and arbitrary weight. A program has been implemented in the mathematical software \texttt{Java} to…
In this paper we present an introduction to the area of computability in dynamical systems. This is a fairly new field which has received quite some attention in recent years. One of the central questions in this area is if relevant…
Since the 1980s, much progress has been done in completely determining which functions share a Julia set. The polynomial case was completely solved in 1995, and it was shown that the symmetries of the Julia set play a central role in…
We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the…
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
We prove that a polynomial Julia set which is a finitely irreducible continuum is either an arc or an indecomposable continuum. For the more general case of rational functions, we give a topological model for the dynamics when the Julia set…
We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…
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…
Recently, the place of the main programming language for scientific and engineering computations has been little by little taken by Julia. Some users want to work completely within the Julia framework as they work within the Python…
The long-standing problem of existence of nowhere dense rational Julia set with positive area has been solved by an example in quadratic polynomials by Buff and Ch\'eritat. Since then many efforts have been devoted to finding out new…