The Setting
Let , and let be an indexed planar configuration. The rank-switch problem concerns exchanges across a fixed position in the projection order as the slope varies.
For planar points and a real slope , the pair slope , sweep projection and orientation determinant are the real quantities given by (1). (1) A configuration is in general position if it is injective and the orientation determinant in (1) is nonzero for every three distinct indices.✦ A generic configuration is a configuration in general position whose first coordinates are pairwise distinct, whose unordered point pairs have pairwise distinct slopes, and for which no point common to the open segments of two distinct point pairs belongs to the closed segment of a third distinct point pair.✦ Unordered pairs are represented by indices .
The below-pair count is the number of indices satisfying the strict projection inequality in (2). (2)✦ For a configuration and an integer rank , the rank-switch count is the number of unordered pairs with below-pair count when , and is zero otherwise, as in (3). (3)✦
Sweeps and Activity
A marked set is projection-separated at slope if for every and .✦ The directed set distance between marked sets is the number of indices in that are absent from .✦ A rank sweep sequence with steps consists of slopes and marked sets , , with projection-separated at and the conditions (4). (4)✦
The critical slopes of form the set .✦ A critical slope traversal of a finite set is a strictly increasing list whose interior cuts are precisely .✦ The canonical traversal of a finite set is the increasing list of its elements with an exterior cut on either side.✦ The intercritical sample slopes of a critical slope traversal are the midpoints in (5). (5)✦ For a generic configuration and , the canonical rank sweep is a rank sweep sequence of (4) with steps, where is the interior-cut count of the canonical traversal of .✦
For a finite family of marked sets and a reference index , the active set consists of indices whose membership differs from that in .✦ For a sweep , the interval active set is the set of indices whose membership in some state from through differs from their membership in state .✦ The activity size of a sweep is the cardinality of its interval active set when and is zero when , as in (6), where denotes symmetric difference.✦ (6) Sweep intervals are step-disjoint when their step-index sets are disjoint.
A greedy activity checkpoint system for a sweep , initial state and integer threshold is an increasing list satisfying (7), with activity measured by (6). (7)✦ For a sweep , an initial state and an integer threshold , the canonical activity checkpoints form a greedy activity checkpoint system satisfying (7).✦ For an integer threshold , the checkpoint count is the number of intervals between consecutive canonical activity checkpoints when and .
For , let be its increasing enumeration.✦ The induced point configuration is the restriction with this indexing, as in (8). (8)✦
For integers and , the activity scale is the integer given by (9). (9)
The Claim
Theorem 1 (Activity packing and rank-switch bounds). There is an integer such that every generic with , at every rank , satisfies the packing estimate (10) at the scale (9). (10)✦
For every generic , rank and integer , there are subsets and integer ranks , indexed by , giving the switch decomposition (11); the induced configurations are those of (8). (11)✦
For each integer , there is a real satisfying the strict exponent conditions (12). (12)✦
Fix an integer and a real . Suppose that for every generic -point configuration with and every rank . Then every generic -point configuration, including , satisfies the induction bound (13) at every such rank. (13)✦
There are absolute real constants and such that every generic with satisfies the uniform bound (14) for the switch counts of (3) at every rank . (14)✦
In the paper, the result reads: if for every there is such that, for every generic planar -point configuration, every rank and every integer with , any collection of step-disjoint intervals of activity at least has at most members, then there are absolute and such that every such rank sweep has at most switches.
What Is Checked
The statements concern indexed generic planar configurations at all ranks, their canonical rank sweeps and canonical activity checkpoints, and the induced configurations on subsets of their indices.