The Setting
Within a periodic text group, several layers can record the same word at aligned positions. Processing a block of the highest layers requires a width bound along the whole text and a count of the recorded occurrences with a specified full-text alignment.
Let be an alphabet and a set of finite words over . The set is substring-closed when every contiguous substring of every word in , including the empty word, also belongs to .✦ Write for the symbol length of a word . A down-edge threading on a finite token set is a word assignment and a successor permutation of : it assigns a nonempty word to each token , with the tail of a prefix of .✦ Its induced integer-indexed text is given by (1), where integer powers of include inverse iterates. (1)✦
Text translation equivalence on the token set is the relation that identifies tokens and when some integer satisfies for every integer .✦ A primitive text group of the threading is an equivalence class of tokens under text translation equivalence.✦ The group text representative of a primitive text group is the text of a representative token of .✦ The primitive group period of is the smallest positive integer whose translation leaves unchanged.✦ A positive integer is a period of a text when for all integers ; it is the least positive period when every positive period is at least .✦
For an integer-indexed text , the finite window lists its symbols at the integer positions in , with the empty word used when .✦ A periodic layer for , and a period parameter is a nondecreasing integer-valued exit function satisfying (2).✦ The first and last exits of a periodic layer with exit function at start are and . (2)
The full-text-aligned token set of a threading for a text is the set of tokens of whose induced text equals at every integer position.✦ Put , and enumerate these tokens bijectively as .✦ The sorted value list of a finite indexed family is a list of the family’s values in nondecreasing order, retaining repetitions✦; the th order statistic of the family is the entry at index in its sorted value list, starting from zero.✦ The unsorted passage exits and sorted layer exits for the text are integer-valued functions of the start position given by (3). (3) For substring-closed and a text with period , the ordered layer is the periodic layer with exit function .✦ The primitive layer indices of the threading are the pairs in which is a primitive text group and ✦; the indexed primitive layer at a primitive layer index is a periodic layer with text and period .✦
A word occurs in at an integer origin when for every .✦ A recorded occurrence at origin of a word in a layer with text is an occurrence of in whose endpoint does not exceed .✦ The layer occurrence set of a word in a periodic layer with text and period is the set of start residues of recorded occurrences in one period, as in (4).✦ These records need not themselves be windows whose endpoints lie between the first and last exits at their starts. (4)✦ The family occurrence set for a word in a threading is the disjoint union of over primitive layer indices of , so an occurrence retains its owner and start residue.✦ For a word , a primitive text group and an integer , the aligned occurrence set is the subset of defined by (5). (5)✦
For an integer exit family , an integer threshold and nonnegative integers , the qualifying index set is the set of layer indices specified in (6). (6)✦
The Claim
Theorem 1 (Lemma 5.1). Let , let be integer exits, and let be an integer threshold with . For a nonnegative integer , suppose . There is an integer satisfying (7). (7)✦
Let and be periodic layers for the same , text and positive period . Let and , and suppose . Then (8) holds at every integer start. (8)✦
Let be a finite down-edge threading through a substring-closed vertex set . For a primitive text group , an integer and a word , its aligned recorded occurrences satisfy (9). (9)✦
What Is Checked
The selection statement ranges over finite nondecreasing integer exit families; the width and occurrence statements concern periodic layers and the primitive layers of finite threadings through substring-closed vertex sets.
Sorted exits are nondecreasing✦ and satisfy the first inequality in (2) for every text .✦ For a text with period , they satisfy the translation identity in (2) with that period.✦ For substring-closed , every window between the preceding and current sorted exits belongs to .✦