The short-cut test

The short-cut test detects existence and uniqueness of “Laplacians” on finitely ramified, graph-directed fractals. Previous results by Sabot, Nussbaum and the author are improved and extended. It opens up the way for further studies because it combines well established spectral, dynamical and analytic techniques. Its algorithmic and recursive structure is designed to provide computable and flexible criteria.