True trees are dense
成果类型：
Article
署名作者：
Bishop, Christopher J.
署名单位：
State University of New York (SUNY) System; Stony Brook University
刊物名称：
INVENTIONES MATHEMATICAE
ISSN/ISSBN：
0020-9910
DOI：
10.1007/s00222-013-0488-6
发表日期：
2014
页码：
433-452
关键词：
摘要：
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.
来源URL：