The Setting
The graph is the incidence graph of 13 points and 22 faces, each face a triple of points: it joins each point to the faces containing it. A face has three point pairs as its sides, held in three slots , and denotes the side in slot .✦ There are 33 point pairs, each a side of exactly two faces.✦ Each face carries a fixed label in .✦ The separation count of a point pair is the number of the three coordinates at which the labels of the two faces through differ, and is one third of it, so that .✦
Each face has a number and each point pair has a number , in an even dimension ; each face also carries a bit saying whether it is active and a gain, both defined below. The numbers and form a profile , which has a cost ; the labels enter the cost through the numbers . The question is which profiles carry a total gain, the global tail gain defined below, at least as large as their cost once is large.
Profiles and Their Cost
Let be a natural number. A geometric profile in dimension is a pair of a natural number for each face and a natural number for each point pair such that, for every face , , for each slot , and the profile sizes satisfy (1)✦
The face natural cost of a face , for a profile in dimension , is the natural number (2)✦ and the profile cost of is the real number (3)✦ where runs over the faces, over the point pairs, and is the triangular function.✦
Tail Tuples and Their Gains
An activity pattern assigns to each face a bit , the face being active when .
A tail tuple consists of three natural numbers , , and two triples and of natural numbers.✦ Its tail sizes are ✦ and its tail heights ✦, with maximal tail height ✦; its tail offset is the real number ✦, and its tail sum is .✦
The planted gain of real numbers , , , and two real triples , is (4)✦ with sums over . The tail gain of a tail tuple in dimension with a bit is (5)✦
The face baseline of real numbers and and real sizes is (6)✦ and the tail slack of in dimension with the bit is , with and the sizes those of .✦ The separation excess of an assignment of a natural number to each point pair is (7)✦
A tail tuple is tail feasible in dimension for a bit when and and, if , also , and for every , and .✦ A family of tail tuples, one for each face, is globally tail feasible in dimension for an activity pattern and an assignment on the point pairs when each is tail feasible for and the tail heights of are the values of on the sides of , the height in slot being .✦
Tail Choices
Let , and be natural numbers and a triple of natural numbers. The common parameter set is the set of integers with and .✦ For a natural number , a quadruple is a choice of feasible base parameters for and when , for distinct , , and, for each , , and ✦; these quadruples form the base parameter set .✦
A full tail choice for , , , is a pair with and .✦ The planted tail tuple of a full tail choice for , , , is the tail tuple , and the lower tail tuple of and is the tail tuple . A face tail choice for a bit is a full tail choice when and the single trivial choice when ✦; its face tail tuple is the planted tail tuple in the first case and the lower tail tuple in the second.✦
Given a profile and an activity pattern , a global tail choice for and assigns to each face a face tail choice for , , , the profile sizes and the bit .✦ The global tail tuple of at is the face tail tuple of ✦, and the global tail gain of is (8)✦
The Claim
Theorem 1. (a) There is an integer such that the following holds for every natural number . Let be an activity pattern, an assignment of a natural number to each point pair and , with , a family of tail tuples that is globally tail feasible in dimension for and and satisfies . Then and for every face , for every point pair , , and (9)✦
(b) There is an integer such that the following holds. Let be a natural number with , let be a geometric profile in dimension , an activity pattern and a global tail choice for and on and . Then (10)✦
(c) Let , the singular tail threshold, be a fixed choice of an integer as in (b).✦ For every natural number with and every , and as in (b), (11)✦
In the paper, the result reads: there is an even-dimensional threshold such that, for every even above it, every feasible profile and activity set with has for all , for all and , where is the profile cost , the activity set is the set of active faces and is the total gain .
What Is Checked
The three parts of the theorem are stated over the configuration of 13 points and 22 faces, with the sides of each face, the two faces through each point pair and the face labels with their separation counts; over geometric profiles, their face natural costs and the profile cost; over tail tuples with their tail feasibility, planted and tail gains, face baseline, tail slack and the separation excess; and over global tail choices, built from the common and base parameter sets through the planted and lower tail tuples, with their global tail gain.