𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Trees and hairs for some hyperbolic entire maps of finite order

✍ Scribed by Krzysztof Barański


Book ID
105875052
Publisher
Springer-Verlag
Year
2007
Tongue
French
Weight
484 KB
Volume
257
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Coloring rules for finite trees, and pro
✍ Alan R. Woods 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

A system of coloring rules is a set of rules for coloring the vertices of any finite rooted tree, starting at its leaves, which has the property that the color assigned to each vertex depends only on how many of its immediate predecessors there are of each color. The asymptotic behavior of the fract