The Setting
Let be a finite graph with vertex set , and suppose that every clique of has at most three vertices. Write for its right-angled Artin group, with standard generators for . The height homomorphism sends each to , and . Quaternion labels will be assigned to paths that pass through two successive height levels of .
The standard coordinate simplex on is the set of nonnegative weights of total mass one, as in (1). (1)✦ For a subset , the closed coordinate face is the subset of defined in (2). (2)✦ The simplex two-skeleton is the subset of consisting of points in faces with at most three vertices, as specified in (3)✦; a triangle point is a point of .✦ (3)
For , denote the length of its reduced normal trace by . When , write for the normalized direction vector supplied by the Artin trace construction.
Let be the group of quaternions of norm one in .✦ Quaternion radial normalization is the map given by for , with a fixed value in at zero.✦ Fix labels and quaternions for . The affine quaternionic gauge on and its normalized gauge on are given by (4). (4) Choose a support vertex for each triangle point , with the condition in (5). (5)✦ For a vertex and triangle points , the local chart transport is the quotient of the gauges at and specified in (6).✦ For triangle points , the rooted transport is the local chart transport at the support vertex , as specified in (6). (6) The two-piece transport through triangle points is the product in traversal order in (7). (7)✦
The Definition
Definition 1. For an element with , its Artin direction point has barycentric coordinates given by the normalized initial-letter counts of its reduced normal trace, as in (8).✦ Its coordinate at a vertex outside the count support is zero. (8)✦ At height , where is a natural number, the integral level is the subset of defined in (9). (9)✦ For and , the level direction point is the point of specified in (10). (10)✦ Given and vertices , the terminal vertex is the group element specified in (11). (11)✦ For , and , the upper vertex is the group element specified in (12). (12)✦ With , and , define the level edge label by the transport in (13). (13)✦
In the paper, the result reads: for a nonempty reduced trace of , assign each occurrence to the first minimal predecessor direction in a fixed order, let count these assignments and put , with the standard coordinate vector and the trace length, and for and with , the zero-level vertex map is for .
What Is Checked
The definition is stated over a finite defining graph whose cliques have at most three vertices, with its normalized Artin trace directions and fixed quaternion data . Every triangle point has a nonzero coordinate.✦