The Setting
An exact overlap of an affine iterated function system is an equality of affine maps associated with two distinct symbolic addresses of . The lengths of the addresses need not agree in the definition.
A weighted affine iterated function system on a finite nonempty alphabet is a family of affine contractions with real signed slopes , real translations , and strictly positive normalized weights , as in (1): (1)✦
A word over is a finite sequence of symbols; its length is , and denotes the empty word. For a word over the alphabet of the affine iterated function system , the word affine composition is the affine map obtained by composing the maps of in address order, with signed slope and translation , as specified in (2): (2)✦ Equality of word maps means equality of both and .
The uniformly weighted system associated with the maps in (1) is the affine iterated function system that assigns the same weight to every symbol, as in (3); write for its word composition: (3)
The Claim
Theorem 1. Let be a weighted affine iterated function system satisfying (1). Suppose are distinct nonempty words with . There are words satisfying (4): (4)✦ For real families on a finite nonempty alphabet with , let be the uniform system in (3). Suppose are distinct nonempty words with . There are words satisfying (5): (5)✦
In the paper, the result reads: for a finite family with , equality of maps for two distinct nonempty words of arbitrary lengths implies equality of maps for two distinct words of the same length.
What Is Checked
The statements concern finite nonempty words and their complete affine compositions (2), over weighted systems satisfying (1) and the uniform systems of (3).