The Setting
The comparison here uses two periodic texts that agree on a chosen window and orders their forward streams lexicographically.
Let be a linearly ordered alphabet. An integer-indexed text is a function from to . The finite window of an integer-indexed text , for integers , is the word of symbols at the integer positions in , in increasing order; it is empty when .✦ The forward rotation stream of an integer-indexed text at an integer position is the infinite word defined by (1), with streams ordered lexicographically: (1)✦ Two texts and agree on when for every integer with .✦
A substring-closed vertex set is a set of finite words containing every contiguous substring of each of its words, including the empty word.✦ A hierarchical graph walk in is a finite concatenation of steps that append one symbol at the end or delete the first symbol, with every source and target in ; a stationary walk at any vertex of is also allowed.✦ A hierarchical graph walk in visits a word in when is an actual vertex of , including either endpoint.✦ The cost of a hierarchical graph walk in is its number of append steps, and concatenation adds costs.✦
Periodic Layers and Contact
A periodic layer for , a text and a period parameter is an exit function satisfying (2) for all integer : (2)✦ The first and last exit positions of at start are the endpoints and defined in (3): (3)
A hierarchical graph walk in touches a periodic layer for when there are integers with such that visits .✦ A periodic layer for has a short vertex at threshold when some integers satisfy and , where word length counts symbols.✦
The Claim
Theorem 1. Let be a substring-closed set of words over a linearly ordered alphabet, and let be distinct integer-indexed texts. Let be positive integers and an integer. Suppose and for every integer , and suppose contains every one-letter word .
Let be a family of periodic layers for , with distinguished indices ; write for their exit functions and exit positions. Choose integers with such that belongs to and agree on . Assume the bounds in (4), with the first line holding for every and integer , and the second for every integer : (4) There is a hierarchical graph walk from to itself with the properties in (5): (5)✦
What Is Checked
The statement concerns hierarchical graph walks in a substring-closed vertex set and an indexed family of periodic layers, under interval agreement and lexicographic bounds on two distinct periodic texts and the stated bounds on layer exits.