Superquadratic sensitivity separation: recursive #
This file collects the four profile recurrences for one level of the construction, instantiated with
a regular tournament on 2 * M ^ 2 + 1 vertices and a good labeling with 0 < r columns. The
profiles at output true come from RecursiveOne, those at output false from RecursiveZero and
RecursiveJointZero. Iterating these linear recurrences controls sensitivity throughout the
recursive construction.
Main results #
recursive_four_recurrences: the side and joint profiles of the next-level family at both outputs are bounded by linear combinations of the profiles ofF.
References #
For a regular tournament T on 2 * M ^ 2 + 1 vertices, a good labeling A with 0 < r and a
nested family F, the next-level family P satisfies: sideSensitivity P true is at most
M ^ 2 * sideSensitivity F false + r * sideSensitivity F true; jointSensitivity P true is at most
M ^ 2 * jointSensitivity F false + r * sideSensitivity F true; sideSensitivity P false is at
most 15 * sideSensitivity F false + sideSensitivity F true + 3 * jointSensitivity F true; and
jointSensitivity P false is at most 15 * sideSensitivity F false + 3 * jointSensitivity F true.