Related papers: Real quadratic Julia sets can have arbitrarily hig…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
We consider in this paper a sequence of complex analytic functions constructed by the following procedure $f_n(z)=f_{n-1}(z)f_{n-2}(z)+c$, where $c\in\C$ is a parameter. Our aim is to give a thorough dynamical study of this family, in…
A piecewise function of a real variable x returns a value computed from a rule that can be different in each interval of the values of x. The Julia module Piecewise provides an implementation of piecewise functions, where the user is free…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. Almost no computational tasks in real life are…
We show that for large classes of entire functions the Julia set and the escaping set have packing dimension two. For example, this is the case for entire functions which are bounded on a curve tending to infinity. More generally, we show…
In these lectures we give an introduction to the reduction theory of binary forms starting with quadratic forms with real coefficients, Hermitian forms, and then define the Julia quadratic for any degree $n$ binary form. A survey of a…
For a sequence $(\lambda_n)$ of positive real numbers we consider the exponential functions $f_{\lambda_n} (z) = \lambda_n e^z$ and the compositions $F_n = f_{\lambda_n} \circ f_{\lambda_{n-1}} \circ ... \circ f_{\lambda_1}$. For such a…
The Fatou-Julia iteration theory of rational functions has been extended to quasiregular mappings in higher dimension by various authors. The purpose of this paper is an analogous extension of the iteration theory of transcendental entire…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
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 consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph $G$ on $n$ vertices, and two positive integers $k$ and $x$, determine whether $G$ has a set of $k$ vertices whose removal leaves $G$ with at…
For quadratic polynomials with an indifferent fixed point with bounded type rotation number (they have a Siegel disk), much of what is known of their Julia set comes from the study of a quasiconformal model. The model is build from a…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
Let f be a rational function such that the multipliers of all repelling periodic points are real. We prove that the Julia set of such a function belongs to a circle. Combining this with a result of Fatou we conclude that whenever J(f)…
We prove that for every polynomial of one complex variable of degree at least 2 and Julia set not being totally disconnected nor a circle, nor interval, Hausdorff dimension of this Julia set is larger than 1. Till now this was known only in…
We prove several new rigidity results for polynomial automorphisms of $\mathbb C^2$ with positive entropy. A first result is that a complex slice of the (forward or backward) Julia set is never a smooth, or even rectifiable, curve. We also…