On dendrites, generated by polyhedral systems and their ramification points
Abstract
The paper considers systems of contraction similarities in Rd sending a given polyhedron P to polyhedra Pi⊂ P, whose non-empty intersections are singletons and contain the common vertices of those polyhedra, while the intersection hypergraph of the system is acyclic. It is proved that the attractor K of such system is a dendrite in Rd. The ramification points of such dendrite fave finite order whose upper bound depends only on the polyhedron P, and the set of the cut points of the dendrite K is equal to the dimension of the whole K iff K is a Jordan arc.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.