Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
First zero labels
One attempted counterexample starts with every -subset of an -point core and appends one new point to each edge. Fix parity tests
Append the point corresponding to the first zero test; if no test is zero, append a private point. The output is -uniform. The hope was to repair all bad seven-tuples with only one extra incidence per edge, without creating a small global cover.
The following checked obstruction rules out a broad, explicitly specified case. It does not rule out arbitrary nonlinear labels, all linear-test sequences, or other sparse repairs.
Proposition. Suppose is even and
If three distinct joint point types
each occur at least fifty times, the output fails , regardless of the later tests.
Equal-size boxes with prescribed XORs
Suppose points have labels in , with at least thirteen occurrences of each of three distinct labels, and . They can be partitioned into seven -point boxes with any prescribed box XORs whose total equals the XOR of all the points.
To see this, reserve seven points of each chosen type in box 7 and one of each type in each other box, and fill the remaining places arbitrarily. The three pairwise differences of the chosen types are the three nonzero vectors of . For each of boxes 1 through 6, one swap with box 7 can therefore correct any nonzero XOR discrepancy. The unprocessed box still has all three reserved types; box 7 retains enough of each type after at most six swaps. Box 7 is correct at the end because total XOR is invariant.
Index boxes by nonzero , and denote their desired XORs by . One can prescribe both their total XOR and the two linear forms
For each component , these are four independent linear conditions on seven bits: the matrix with columns has rank four. Indeed, a relation for every nonzero first gives on basis vectors and then on sums of two basis vectors.
The bad tuple
Write
Among the three abundant types choose with first bits zero and one, respectively. Give each of seven prospective rows its own core points: one of type and of type . Their joint XOR is the same vector in every row, with .
At most 21 points of either chosen type have been used. Select further core points containing at least thirteen of each of the three abundant types. This is possible because
Apply the box lemma, prescribing independent standard row-linear forms . For each nonzero , let consist of the four boxes indexed by with , together with that row's selected private core points. Then and
The rows receiving label form the four-point Fano cap . The three remaining rows form the line . Since are independent, the second test splits this line nontrivially into parts of sizes one and two. Thus occurs on one or two rows, and every later label occurs on a subset of the remaining one or two rows. There are at least three label classes, and no label class contains a Fano line.
Every standard core point has a Fano-cap spectrum; every private core point has singleton spectrum; unused points have empty spectrum. Two core points cannot cover the rows. A label combined with a standard point would require its class to contain the complementary Fano line, which it does not. A label and a singleton point cover at most five rows. Finally, two labels cannot cover the three or more nonempty label classes. Hence the seven augmented edges have no two-point transversal.
Scope
The assumption concerns the first two tests and three large joint point classes. It is satisfied by many balanced linear-test proposals, but is not automatic for arbitrary tests. No construction preserving with a linear excess over was obtained by this method.