The Setting
Processing periodic layers in the hierarchical graph assigns the cost of visiting their windows to group budgets. A link to another layer may be planned before its connecting walk is executed.
Let be a set of finite words over a linearly ordered alphabet . A substring-closed set contains every contiguous substring of each of its words, including the empty word.✦ A hierarchical walk on is a walk with vertices in , with up steps appending one symbol and down steps deleting the first symbol; walks concatenate at a common endpoint and may be stationary.✦ Write for the actual vertices visited by , including its endpoints, and for its number of up steps. Costs add under concatenation. A based closed walk starts and ends at a chosen vertex; its visitation and cost are those of its underlying walk. A rooted walk starts and ends at the empty word .
For an integer-indexed text , let be its finite window on the half-open interval , with the empty word when .✦ A periodic layer of with period parameter is a nondecreasing integer-valued exit function satisfying the bounds and shift rule in (1), with first and last exit positions and and set of actual layer vertices as given there. (1) A walk touches a layer when its visited vertices intersect .✦
An ordered layer collection has a set of groups and assigns to each group a text with a positive period , a positive number of layers, and layers for . The period need not be the least positive period. For , their exit functions satisfy at every integer . Distinct groups have texts that differ at some position after every integer shift. A grouped layer index of is a pair consisting of a group and a layer index in that group; write , and for its layer vertices. For a set of indices in group , put , and for any set of grouped indices put .
The forward rotation stream of at phase is , ordered lexicographically.✦ A greatest rotation phase is a phase whose stream is greatest among all integer phases.✦ The greatest rotation rank is the stream at .✦
Records and Reserves
A shifted layer record from group to a layer is an interval and an integer shift satisfying (2).✦ (2) A shifted layer record from group to layer is foreign when there is an integer with .
A child request at a layer consists of a source group , a nonempty finite set of its layer indices and a foreign record to , with the margins in (3).✦ A pending request is a child request at a layer with its target specified.✦ For a pending request from group with layer index set , its source is , its member indices are , and its period budget and reserve are and in (3). (3)
Write for the set of outgoing plans for the ordered layer collection . An outgoing plan consists of a source , a nonempty finite member set of layers of , a target and a foreign record to . Put and . Its reserve pays for base turns and connections.✦ The plan requires the closed walks in (4), where ; the walks in the different requirements may be different. (4)
For a rooted walk , a finite family of outgoing plans and a finite family of pending requests, layer coverage of an index is the condition in (5). (5)✦
For a finite family of exit positions , a threshold and nonnegative integers , the qualifying indices are .✦ An ordered layer collection has foreign record supply if the following condition holds for every and positive : when and , there is a foreign record to some layer with the endpoints in (6). (6)✦
The Claim
Theorem 1. Let be an ordered layer collection on a substring-closed vertex set over a linearly ordered alphabet.
Suppose has foreign record supply. Fix a group and a finite family of pending requests whose targets belong to and whose sources are pairwise distinct. There are a rooted walk , a finite family of outgoing plans and a finite family of pending requests satisfying (7). (7)✦
Suppose has foreign record supply. Let be finite and upward closed under strictly larger periods: for and , also . Let be a rooted walk, a finite family of outgoing plans and a finite family of pending requests. Assume that each request targets a group in , has its source outside , and has a source different from every other request’s source. Assume every layer whose group is outside satisfies . There is a rooted walk satisfying (8). (8)✦
Let be a nonempty finite set of indices in group , with , and . Let be a foreign record to with . Suppose the sharp-band inequality holds, together with and . There is a collective outgoing plan with source , member set , target and record , as in (9). (9)✦
Let be a layer index in group and a foreign record to . Suppose . There is an individual outgoing plan with source , the single member layer , target and record , as in (10). (10)✦
In the paper, the result reads: after all groups are processed, every layer is marked rooted or belongs to exactly one outgoing block, disjointly, each block comes from one primitive-text group, targets a single actual layer and retains its total budget for its planned link, collective blocks of layers and period satisfy the sharp-band inequality at their distinguished position, and individual blocks contain one layer.
What Is Checked
The statements concern ordered periodic layers and their actual windows, shifted records, hierarchical walks and finite families of plans and requests; the group-processing and scheduling bounds assume foreign record supply.