True trees are dense (Q742834): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00222-013-0488-6 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00222-013-0488-6 / rank
 
Normal rank

Latest revision as of 02:47, 10 December 2024

scientific article
Language Label Description Also known as
English
True trees are dense
scientific article

    Statements

    True trees are dense (English)
    0 references
    19 September 2014
    0 references
    The author shows that any continuum in the plane can be approximated by the critical points of a polynomial with only two critical values. More precisely, for any compact, connected set \(K\) in the complex plane \(\mathbb C\) and any \(\epsilon>0\) there is a polynomial \(p\) with critical values exactly \(\pm 1\) so that \(T = p^{-1}([1, 1])\) approximates \(K\) to within \(\epsilon\) in the Hausdorff metric.
    0 references
    0 references
    polynomials with two critical values
    0 references
    finite planar trees
    0 references

    Identifiers