True trees are dense (Q742834)

From MaRDI portal





scientific article; zbMATH DE number 6346227
Language Label Description Also known as
default for all languages
No label defined
    English
    True trees are dense
    scientific article; zbMATH DE number 6346227

      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