Abstract
We show that any compact, connected set K in the plane can be approximated by the critical points of a polynomial with two critical values. Equivalently, K can be approximated in the Hausdorff metric by a true tree in the sense of Grothendieck's dessins d'enfants.
| Original language | English |
|---|---|
| Pages (from-to) | 433-452 |
| Number of pages | 20 |
| Journal | Inventiones Mathematicae |
| Volume | 197 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 2014 |
Keywords
- 30C62
Fingerprint
Dive into the research topics of 'True trees are dense'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver