Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with complex-dynamics
Search options questions only
not deleted
user 26522
Dynamics of holomorphic transformations; Mandelbrot and Julia sets.
9
votes
0
answers
320
views
Discriminants of Gleason's period-$n$ polynomials for the Mandelbrot set
Gleason's polynomials are the sequence of monic integer polynomials defined recursively by
$$
\prod_{d \mid n} G_d(c) = (((c^2+c)^2+c)^2+\cdots+c)^2+c \quad \quad \quad [\textrm{$n$ iterates}],
$$
for …
- 13.8k
13
votes
0
answers
309
views
Diophantine approximation in the Julia set
Let $f : \mathbb{CP}^1 \to \mathbb{CP}^1$ be a rational map of degree $q > 1$; or just a quadratic binomial $z^2 + c$, if one prefers. The Julia set $J_f$ is the closure of the repelling periodic poin …
- 13.8k
6
votes
3
answers
338
views
Clustering of periodic points for a polynomial iteration of $\mathbb{C}$
Let $f : \mathbb{C} \to \mathbb{C}$ be a polynomial map of degree $q > 1$. Consider $E_n \subset \mathbb{C}$ the set of periodic points with period (dividing) $n$; generally, $|E_n| = q^n$. Since all …
- 13.8k