Related papers: Poly-time Computability of the Feigenbaum Julia se…

We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…

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…

We show that repelling periodic points are landing points of periodic rays for exponential maps whose singular value has bounded orbit. For polynomials with connected Julia sets, this is a celebrated theorem by Douady, for which we present…

In recent years, there has been significant progress in the understanding of the dynamics of transcendental entire functions with bounded postsingular set. In particular, for certain classes of such functions, a complete description of…

For any polynomial map with a single critical point, we prove that its lower Lyapunov exponent at the critical value is negative if and only if the map has an attracting cycle. Similar statement holds for the exponential maps and some other…

In this paper we study rational Collet-Eckmann maps for which the Julia set is not the whole sphere and for which the critical points are recurrent at a slow rate. In families where the orders of the critical points are fixed, we prove that…

Let f and g two rational functions having the same Julia set J_f. Lets suppose that f has a rational indifferent periodic point and that the critical set of f is disjoint of J_f. Then or J_f has to be equal to P^1, a circle, an arc of a…

We use the methods developed with M. Lyubich for proving complex bounds for real quadratics to extend E. De Faria's complex a priori bounds to all critical circle maps with an irrational rotation number. The contracting property for…

In this paper we prove that the Conjugacy Problem in the Grigorchuk group $\Gamma$ has polynomial time complexity.

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…

This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…

We extend the methods and results of [arXiv 1603.04896] to the setting of multinomial distributions satisfying certain properties. These include all the multinomial distributions arising from the direct proof of the Central Limit Theorem…

The maximum clique problem is a classical NP-complete problem in graph theory and has important applications in many domains. In this paper we show, in a partially non-constructive way, the existence of an exact polynomial-time algorithm…

The invariant class under parabolic and near-parabolic renormalizations constructed by Inou and Shishikura has been proved to be extremely useful in recent years. It leads to several important progresses on the dynamics of certain…

There is a subset of computational problems that are computable in polynomial time for which an existing algorithm may not complete due to a lack of high performance technology on a mission field. We define a subclass of deterministic…

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

We present the strongest known knot invariant that can be computed effectively (in polynomial time).

A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the…

The multiplier $\lambda_n$ of a periodic orbit of period $n$ can be viewed as a (multiple-valued) algebraic function on the space of all complex quadratic polynomials $p_c(z)=z^2+c$. We provide a numerical algorithm for computing critical…

The asymptotic behaviour of the solutions of Poincar\'e's functional equation $f(\lambda z)=p(f(z))$ ($\lambda>1$) for $p$ a real polynomial of degree $\geq2$ is studied in angular regions of the complex plain. The constancy of an occurring…