{"title":"Iterated graph systems and the combinatorial Loewner property","authors":"Riku Anttila, Sylvester Eriksson-Bique","doi":"arxiv-2408.15692","DOIUrl":null,"url":null,"abstract":"We introduce iterated graph systems which yield fractal spaces through a\nprojective sequence of self-similar graphs. Our construction yields new\nexamples of self-similar fractals, such as the pentagonal Sierpi\\'nski carpet\nand a pillow-space, and it yields a new framework to study potential theory on\nmany standard examples in the literature, including generalized Sierpi\\'nski\ncarpets. We demonstrate that a fractal arising from an iterated graph system\nsatisfying mild geometric conditions and having enough reflection symmetries,\nsatisfies the combinatorial Loewner property (CLP) of Bourdon and Kleiner. For\ncertain exponents, one can also obtain the conductive homogeneity condition of\nKigami. This shows, in a precise sense, that self-similarity and sufficient\nsymmetry yields CLP. Furthermore, we show that our examples satisfy important asymptotic behaviors\nof discrete moduli. In particular, we establish the so-called\nsuper-multiplicative inequality for our examples - which when $p=2$ plays a\ncrucial role in the study of Dirichlet forms and random walks on fractals. This\nimplies the super-multiplicativity bound also for many fractals for which it\nwas not known before, such as the Menger sponge. A particular feature here is\nusing replacement flows and the notion of a flow basis. This yields a simpler\nway to establish many known estimates, and allows us to prove several new ones.\nFurther, super-multiplicativity shows that one can effectively estimate the\nconformal dimensions numerically for many self-similar fractals.","PeriodicalId":501444,"journal":{"name":"arXiv - MATH - Metric Geometry","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Metric Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.15692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce iterated graph systems which yield fractal spaces through a
projective sequence of self-similar graphs. Our construction yields new
examples of self-similar fractals, such as the pentagonal Sierpi\'nski carpet
and a pillow-space, and it yields a new framework to study potential theory on
many standard examples in the literature, including generalized Sierpi\'nski
carpets. We demonstrate that a fractal arising from an iterated graph system
satisfying mild geometric conditions and having enough reflection symmetries,
satisfies the combinatorial Loewner property (CLP) of Bourdon and Kleiner. For
certain exponents, one can also obtain the conductive homogeneity condition of
Kigami. This shows, in a precise sense, that self-similarity and sufficient
symmetry yields CLP. Furthermore, we show that our examples satisfy important asymptotic behaviors
of discrete moduli. In particular, we establish the so-called
super-multiplicative inequality for our examples - which when $p=2$ plays a
crucial role in the study of Dirichlet forms and random walks on fractals. This
implies the super-multiplicativity bound also for many fractals for which it
was not known before, such as the Menger sponge. A particular feature here is
using replacement flows and the notion of a flow basis. This yields a simpler
way to establish many known estimates, and allows us to prove several new ones.
Further, super-multiplicativity shows that one can effectively estimate the
conformal dimensions numerically for many self-similar fractals.