Hierarchy of graph matchbox manifolds

TL;DR

This paper introduces a hierarchy of graph matchbox manifolds, a class of graph foliated spaces, and develops a fusion construction to analyze their dynamical complexity and properties.

Contribution

It defines a new measure of complexity called 'level' for graph foliated spaces and introduces the fusion technique to study their hierarchical structure.

Findings

Established a hierarchy of graph foliated spaces at infinite levels

Developed the fusion construction as a new analytical tool

Constructed examples with diverse dynamical and geometric properties

Abstract

We study a class of graph foliated spaces, or graph matchbox manifolds, initially constructed by Kenyon and Ghys. For graph foliated spaces we introduce a quantifier of dynamical complexity which we call its level. We develop the fusion construction, which allows us to associate to every two graph foliated spaces a third one which contains the former two in its closure. Although the underlying idea of the fusion is simple, it gives us a powerful tool to study graph foliated spaces. Using fusion, we prove that there is a hierarchy of graph foliated spaces at infinite levels. We also construct examples of graph foliated spaces with various dynamical and geometric properties.