Related papers: A simple proof of Sullivan's complex bounds

A while ago MLC (the conjecture that the Mandelbrot set is locally connected) was proven for quasi-hyperbolic points by Douady and Hubbard, and for boundaries of hyperbolic components by Yoccoz. More recently Yoccoz proved MLC for all at…

We extend Sullivan's complex a priori bounds to real quadratic polynomials with essentially bounded combinatorics. Combined with the previous results of the first author, this yields complex bounds for all real quadratics. Local…

We prove the a priori bounds for infinitely renormalizable quadratic polynomials for which we can find an infinite sequence of primitive renormalizations such that the ratios of the periods of successive renormalizations is bounded. This…

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…

We prove the uniform hyperbolicity of the near-parabolic renormalization operators acting on an infinite-dimensional space of holomorphic transformations. This implies the universality of the scaling laws, conjectured by physicists in the…

In this paper we prove {\it a priori bounds} for infinitely renormalizable quadratic polynomials satisfying a ``molecule condition''. Roughly speaking, this condition ensures that the renormalization combinatorics stay away from the…

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

In the late 1980's Sullivan initiated a programme to prove quasisymmetric rigidity in one-dimensional dynamics: interval or circle maps that are topologically conjugate are quasisymmetrically conjugate (provided some obvious necessary…

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…

For every integer $k$ there exists a bound $B=B(k)$ such that if the characteristic polynomial of $g\in \operatorname{SL}_n(q)$ is the product of $\le k$ pairwise distinct monic irreducible polynomials over $\mathbb{F}_q$, then every…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We show that the Fourier transform of Patterson-Sullivan measures associated to convex cocompact groups of isometries of real hyperbolic space decays polynomially quickly at infinity. The proof is based on the $L^2$-flattening theorem…

Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

Given a pseudoconvex hypersurface in C^n and an arbitrary weight, we show the existence of local coordinates in which the polynomial model contains a particularly simple sum of squares of monomials. Our second main result provides a…

We prove the "Sullivan Conjecture" on the classification of 4-dimensional complete intersections up to diffeomorphism. Here an $n$-dimensional complete intersection is a smooth complex variety formed by the transverse intersection of $k$…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

We extend bounds, proved by R.C. Thompson in 1966, on the sum of the $j$-th largest eigenvalues of the $(n-1) \times (n-1)$ principal matrices of an $n \times n$ Hermitian matrix. Our bounds are stronger than just summing up Thompson's…