The Setting
The host matrix has an anchor part and a nonanchor part in both its row and column index sets. The nonanchor part consists of signed tree levels and a dummy class. Fix a nonnegative integer , put , and write . All position indices start at zero.
A constraint mode is an element of .✦ Its mode type and mode level are given by (1); there are six types at each edge level. (1)
A variable position is an element of , where is its class index and its offset.✦ Its tree depth , positive sign and tree node index are defined by (2). Here and below is when the condition holds and otherwise. (2)
An anchor position in is a triple recording its mode , anchor group and offset .✦ The dummy class is a set of dummy positions disjoint from . The nonanchor position set and full host position set are the disjoint unions in (3). (3)
The Host Entries
For a tree depth and , the signed level is the set of variable positions of depth whose sign is , except that both signs include the whole leaf level.✦ The parity subclass of the signed level is the set of positions in that level whose tree node index has parity . These sets are defined in (4), for . (4)
For a mode , the row role and column role are subsets of specifying the positions assigned to body index . They contain no anchor positions. With , their definitions are the six rows of (5), indexed by . (5)
For variable positions , the variable matrix entry is the binary value in (6). For integer node indices , the two thresholds used there are and . (6)✦
The binary digit , for nonnegative integers , and the anchor matrix are defined by (7). The exceptional rectangle of has row indices through and column indices through . (7)
The raw host matrix is the binary matrix whose entries are specified in (8). In the first three lines the displayed triples are anchor positions; in the second and third lines , respectively. The last line applies when at least one of the two nonanchor positions is a dummy. (8)✦
For a column selection in , repetitions are allowed. The nonanchor word map of a column selection in is the map from to that sends each nonanchor row to its five-bit trace in the raw host matrix : (9)
The Claim
Theorem 1. Let be a nonnegative integer. For every selection , the word map in (9) satisfies (10)✦ For a selection with for every , (11)✦
In the paper, the result reads: for any five distinct nonanchor columns of , the nonanchor rows do not realize all binary words on those columns.
What Is Checked
The claims (10) and (11) are stated over the raw host matrix (8) at every nonnegative height, with rows in and five selected nonanchor columns.