Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Published pp. 226–227, Claim 3.7 and its proof. (canonical PDF).
Use the construction of lemma_3_5 and fix distinct rows , so . For ,
and for ,
These are the printed formulas (13) and (14) (p. 226). The reverse mixed-zero formula follows by exchanging the rows. Also, as an addition not in the printed claim,
Proof.
Fixing two row labels leaves exactly choices for the other entries of a word . Therefore the added blocks contribute to every one of these intersections.
For positive labels, the two core parts are single blocks and , whose intersection has size if the indices agree and zero otherwise. In a mixed-zero intersection, lies in the other row's zero part precisely when its index is absent from . For two zero labels, the common core blocks are exactly those indexed outside . The core and added blocks are disjoint, so adding these contributions proves all formulas.
Source precision.
The mixed-zero displayed unions on p. 227 contain inconsistent dummy-label conditions. The formulas above impose the actual labels of the two parts. The two-zero formula is an elementary completion of the same count; its coefficient in the squared-distance sum is zero because .
Bears on. #174.