Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets
Bibliographic record
Abstract
The present thesis is dedicated to two topics in Dynamics of\nHolomorphic maps. The first topic is dynamics of simple parabolic\ngerms at the origin. The second topic is Polynomial-time\nComputability of Julia sets.\\\\\n\nDynamics of simple parabolic germs. Let $F$ be a germ with a\nsimple parabolic fixed point at the origin: $F(w)=w+w^2+O(w^3).$ It\nis convenient to apply the change of coordinates $z=-1/w$ and\nconsider the germ at infinity $$f(z)=-1/F(-1/z)=z+1+O(z^{-1}).$$ The\ndynamics of a germ $f$ can be described using Fatou coordinates.\nFatou coordinates are analytic solutions of the equation\n$\\phi(f(z))=\\phi(z)+1.$ This equation has a formal solution\n \\[\\tilde\\phi(z)=\\text{const}+z+A\\log z+\\sum_{j=1}^\\infty b_jz^{-j},\\] where\n $\\sum b_jz^{-j}$ is a divergent power series. Using \\'Ecalle's Resurgence Theory we show\nthat $\\tilde{\\phi}$ can be interpreted as the asymptotic expansion of\nthe Fatou coordinates at infinity. Moreover, the Fatou coordinates\ncan be obtained from $\\tilde \\phi$ using Borel-Laplace\nsummation. J.~\\'Ecalle and S.~Voronin independently constructed a\ncomplete set of invariants of analytic conjugacy classes of germs\nwith a parabolic fixed point. We give a new proof of validity of\n\\'Ecalle's construction.\n\\\\\n Computability of Julia sets. Informally, a compact subset of\nthe complex plane is called \\emph{computable} if it can be\nvisualized on a computer screen with an arbitrarily high precision.\nOne of the natural open questions of computational complexity of\nJulia sets is how large is the class of rational functions (in a\nsense of Lebesgue measure on the parameter space) whose Julia set\ncan be computed in a polynomial time. The main result of Chapter II\nis the following: Theorem. Let $f$ be a rational\nfunction of degree $d\\ge 2$. Assume that for each critical\npoint $c\\in J_f$ the $\\omega$-limit set $\\omega(c)$ does not contain\neither a critical point or a parabolic periodic point of $f$. Then\nthe Julia set $J_f$ is computable in a polynomial time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".