True trees are dense

From MaRDI portal
Publication:742834

DOI10.1007/S00222-013-0488-6zbMATH Open1304.30028arXiv2007.04062OpenAlexW2030799683MaRDI QIDQ742834FDOQ742834


Authors: Christopher J. Bishop Edit this on Wikidata


Publication date: 19 September 2014

Published in: Inventiones Mathematicae (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2007.04062




Recommendations




Cites Work


Cited In (8)





This page was built for publication: True trees are dense

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742834)