The short-cut test

From MaRDI portal





The existence of ``Laplacians on finitely ramified fractals was only known for the the very small subclass of nested fractals. In this paper the author proposes a short-cut test for the existence and uniqueness of Laplacians on finitely ramified graph directed fractals. The results of this paper improve and extend previous results by Sabot, Nussbaum and the author. The short-cut test proposed in this paper is of algorithmic and recursive nature.



Cites work









This page was built for publication: The short-cut test

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766552)