The Setting
Opening periodic layers calls for a closed walk that touches each layer while spending few symbol appends.
A substring-closed vertex set over an alphabet is a set of finite words that contains every contiguous substring of each of its words, including the empty word .✦ For an integer-indexed text and integer endpoints , the finite text window is the word defined by (1). (1)✦
A hierarchical walk in is a finite walk whose steps append a symbol at the right or delete a symbol at the left, with every vertex in ; a walk may have no steps.✦ The cost of a hierarchical walk is the number of append steps in .✦ A walk visits a word when that word is one of its vertices, including its endpoints.✦
Periodic Layers
A periodic layer for , and a nonnegative integer parameter is a nondecreasing exit function satisfying (2) for all integer positions and endpoints . (2)✦ The first and last exit positions and of a periodic layer at an integer position are the integer endpoints specified by (3). (3)
A hierarchical walk touches a layer if it visits a window for some integers with .✦
The Claim
Theorem 1 (One free period). Let be substring-closed, let be a text whose one-letter words all belong to , and let satisfy for every integer . Let be periodic layers for , with indices such that for every and every integer . Suppose an integer satisfies . There is a closed hierarchical walk in , based at , satisfying (4). (4)✦
What Is Checked
The claim is stated over hierarchical walks in a substring-closed vertex set containing the text’s one-letter words, with a periodic text and a family of layers satisfying the extremal ordering and band hypothesis.