The Setting
A collective connection asks for a closed walk based at a specified text window that meets each layer in a family. The cost counts the symbols appended along the walk.✦
Let be an alphabet and an integer-indexed text. For integers , the finite text window of the integer-indexed text is the word on the half-open interval , with the empty word when .✦ A substring-closed set of words over is a set containing every contiguous substring of each of its words, including the empty word.✦
A hierarchical walk in is a finite concatenation of steps that append a symbol at the end or delete the first symbol, with every vertex in ; a stationary walk at any vertex of is also allowed.✦ Write for the cost of . A walk visits a word when that word is an actual vertex of the walk, including either endpoint.✦
Fix a nonnegative integer . A periodic layer for , and is a nondecreasing function satisfying (1) for all integers : (1)✦ The first and last exit positions of at a start are the endpoints and defined in (2): (2) A hierarchical walk touches a layer when there are integers with such that visits the word .✦
The Claim
Theorem 1 (Collective link). Suppose is substring-closed, contains every one-letter word , and for every integer . Let be a nonnegative integer and a family of periodic layers for , and . Choose indices such that for every and integer . Let be integers with , and assume the endpoint bounds (3): (3) Then there is a closed hierarchical walk based at satisfying (4): (4)✦
What Is Checked
The claim is stated over hierarchical walks in a substring-closed word set containing every letter of the periodic text, and an arbitrary indexed family of layers with pointwise lower and upper members.