Self-similar Strings Research Articles

Quasiperiodic Patterns of the Complex Dimensions of Nonlattice Self-Similar Strings, via the LLL Algorithm

The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self-similar fractal string. The implication of this procedure is that the set of complex dimensions of a nonlattice string has a quasiperiodic pattern. Using the LSA algorithm, together with the multiprecision polynomial solver MPSolve which is due to D. A. Bini, G. Fiorentino and L. Robol, we give a new and significantly more powerful presentation of the quasiperiodic patterns of the sets of complex dimensions of nonlattice self-similar fractal strings. The implementation of this algorithm requires a practical method for generating simultaneous Diophantine approximations, which in some cases we can accomplish by the continued fraction process. Otherwise, as was suggested by Lapidus and van Frankenhuijsen, we use the LLL algorithm of A. K. Lenstra, H. W. Lenstra, and L. Lovász.

Random fractal strings: Their zeta functions, complex dimensions and spectral asymptotics

In this paper a string is a sequence of positive non-increasing real numbers which sums to one. For our purposes a fractal string is a string formed from the lengths of removed sub-intervals created by a recursive decomposition of the unit interval. By using the so-called complex dimensions of the string, the poles of an associated zeta function, it is possible to obtain detailed information about the behaviour of the asymptotic properties of the string. We consider random versions of fractal strings. We show that by using a random recursive self-similar construction, it is possible to obtain similar results to those for deterministic self-similar strings. In the case of strings generated by the excursions of stable subordinators, we show that the complex dimensions can only lie on the real line. The results allow us to discuss the geometric and spectral asymptotics of one-dimensional domains with random fractal boundary.

Complex Dimensions of Self-Similar Fractal Strings and Diophantine Approximation

We study the solutions in s of a “Dirichlet polynomial equation” miri + … + m M r s M = 1. We distinguish two cases. In the lattice case, when r j = r k j are powers of a common base r, the equation corresponds to a polynomial equation, which is readily solved numerically by using a computer. In the nonlattice case, when some ratio log r j / log r 1, j ≥ 2, is irrational, we obtain information by approximating the equation by lattice equations of higher and higher degree. We show that the set of lattice equations is dense in the set of all equations, and deduce that the roots of a nonlattice Dirichlet polynomial equation have a quasiperiodic structure, which we study in detail both theoretically and numerically. This question is connected with the study of the complex dimensions of self-similar strings. Our results suggest, in particular, that a nonlattice string possesses a set of complex dimensions with countably many real parts (fractal dimensions) which are dense in a connected interval. Moreover, we find dimension-free regions of nonlattice self-similar strings. We illustrate our theory with several examples. In the long term, this work is aimed in part at developing a Diophantine approximation theory of (higher-dimensional) selfsimilar fractals, both qualitatively and quantitatively.