Good labeling property of simple nested fractals

Abstract

We show various criteria to verify if a given nested fractal has a good labeling property, inter alia we present a characterization of GLP for fractals with an odd number of essential fixed points. We show a convenient reduction of the area to be investigated in the verification of GLP and give examples that further reduction is impossible. We prove that if the number of essential fixed points is a power of two, then a fractal must have GLP and that there are no values other than primes or powers of two guaranteeing GLP. For all other numbers of essential fixed points, we are able to construct examples having and others not having GLP.