[Theory-reading] generalization of Hastad-Wigderson

[Dieter van Melkebeek <dieter@xxxxxxxxxxx>]

Hi all,

Yesterday I suggested a generalization for degree-d testing using 
(d+1)-uniform hypergraphs. I realized there is a more natural 
generalization. For the line-test, we only need to pick two points to 
determine the line as well as all d-1 other points on the line we need, so 
we can still model the process still standard graphs. For the plane-test, 
we need to pick three points to determine the plane and the points in the 
plane we need, so we can model the process using 3-uniform hypergraphs.
Best,

 -- Dieter