Wiki
Wiki

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 i,hi,h, so r≥2r\ge2. For 1≤j,j′≤k1\le j,j'\le k,

∣Aj(i)∩Aj′(h)∣=bqr−2+l 1{uj(i)=uj′(h)},|A^{(i)}_j\cap A^{(h)}_{j'}| =bq^{r-2}+l\,\mathbf1_{\{u^{(i)}_j=u^{(h)}_{j'}\}},

and for 1≤j≤k1\le j\le k,

∣Aj(i)∩A0(h)∣=bqr−2+l 1{uj(i)∉K(h)}.|A^{(i)}_j\cap A^{(h)}_0| =bq^{r-2}+l\,\mathbf1_{\{u^{(i)}_j\notin K^{(h)}\}}.

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,

∣A0(i)∩A0(h)∣=bqr−2+l(s−∣K(i)∪K(h)∣).|A^{(i)}_0\cap A^{(h)}_0| =bq^{r-2}+l\bigl(s-|K^{(i)}\cup K^{(h)}|\bigr).

Proof.

Fixing two row labels leaves exactly qr−2q^{r-2} choices for the other entries of a word ww. Therefore the added blocks contribute bqr−2bq^{r-2} to every one of these intersections.

For positive labels, the two core parts are single blocks Luj(i)L_{u^{(i)}_j} and Luj′(h)L_{u^{(h)}_{j'}}, whose intersection has size ll if the indices agree and zero otherwise. In a mixed-zero intersection, Luj(i)L_{u^{(i)}_j} lies in the other row's zero part precisely when its index is absent from K(h)K^{(h)}. For two zero labels, the common core blocks are exactly those indexed outside K(i)∪K(h)K^{(i)}\cup K^{(h)}. 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 a0=0a_0=0.

Bears on. #174.