Related papers: Complex bounds for critical circle maps
We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…
We study the sharp doubling inequalities for the gradients and upper bounds for the critical sets of Dirichlet eigenfunctions on the boundary and in the interior of compact Riemannian manifolds. Most efforts are devoted to obtaining the…
Non-renormalizable Newton maps are rigid. More precisely, we prove that their Julia set carries no invariant line fields and that the topological conjugacy is equivalent to quasi-conformal conjugacy in this case.
We prove that proper pseudo-holomorphic maps between strictly pseudoconvex regions in almost complex manifolds extend to the boundary. The key point is that the Jacobian is far from zero near the boundary, and the proof is mainly based on…
Given $C^2$ infinitely renormalizable unimodal maps $f$ and $g$ with a quadratic critical point and the same bounded combinatorial type, we prove that they are $C^{1+\alpha}$ conjugate along the closure of the corresponding forward orbits…
When does topological recursion applied to a family of spectral curves commute with taking limits? This problem is subtle, especially when the ramification structure of the spectral curve changes at the limit point. We provide sufficient…
We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose…
In this paper we develop a technique to extend any bound for cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes. We use this technique to improve the searching of new bounds for abelian codes.
We introduce the exciting field of complex dynamics at an undergraduate level while reviewing, reinforcing, and extending the ideas learned in an typical first course on complex analysis. Julia sets and the famous Mandelbrot set will be…
We prove convergence of renormalized correlations of primary fields, i. e., spins, disorders, fermions and energy densities, in the scaling limit of the critical Ising model in arbitrary finitely connected domains, with fixed (plus or…
We prove that there exists a dense set of analytic expanding maps of the circle for which the Ruelle eigenvalues enjoy exponential lower bounds. The proof combines potential theoretic techniques and explicit calculations for the spectrum of…
Holomorphic renormalization plays an important role in complex polynomial dynamics. We consider certain conditions guaranteeing that a polynomial which does not admit a polynomial-like connected Julia set still admits an invariant continuum…
This article deals with the question of local connectivity of the Julia set of polynomials and rational maps. It essentially presents conjectures and questions.
In this paper we study an index of a critical orbit, defined in terms of the degree for invariant strongly indefinite functionals. We establish a relationship of this index with the index of a critical point of the mapping restricted to the…
We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…
We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
We describe a new and robust method to prove rigidity results in complex dynamics. The new ingredient is the geometry of the critical puzzle pieces: under control of geometry and ``complex bounds'', two generalized polynomial-like maps…
Quasiconformal maps in the complex plane are homeomorphisms that satisfy certain geometric distortion inequalities; infinitesimally, they map circles to ellipses with bounded eccentricity. The local distortion properties of these maps give…