Green's removal-property conjecture for homogeneous linear systems

Let MM be an ×p\ell\times p integer matrix of rank \ell, and consider the homogeneous system of linear equations Mx=0Mx=0. A set S[n]S\subseteq[n] is (M,0)(M,0)-free if it contains no vector xSpx\in S^p satisfying Mx=0Mx=0. The system has the removal property if, for every δ>0\delta>0, there is an ϵ=ϵ(δ,M,0)>0\epsilon=\epsilon(\delta,M,0)>0 such that whenever S[n]S\subseteq[n] contains at most ϵnp\epsilon n^{p-\ell} solutions in SpS^p to Mx=0Mx=0, at most δn\delta n elements can be removed from SS to obtain an (M,0)(M,0)-free set.

Green's conjecture. Every system of homogeneous linear equations Mx=0Mx=0 has the removal property.

Green proved this for a single homogeneous linear equation. The conjecture asks for the corresponding removal statement for arbitrary systems and is resolved by the main result of the paper using the hypergraph removal lemma.

Sources & referencesView supporting material

Primary source

Asaf Shapira, “A Proof of Green's Conjecture Regarding the Removal Properties of Sets of Linear Equations”, arXiv:0807.4901 (2008).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.