Let \(| {\mathcal S}| =n^ 2+n+1\), \(A_ i\subset {\mathcal S}\), \(| A_ i| =n+1\) for \(1\leq i\leq n^ 2+n+1\). Assume that the A's are the lines of a finite geometry in \({\mathcal S}\), i.e. \(| A_ i\cap A_ j| =1\) for \(1\leq i<j\leq n^ 2+n+1.\) The author proves that if \({\mathcal S}_ 1\cup {\mathcal S}_ 2={\mathcal S}_ 1{\mathcal S}_ 1\cap {\mathcal S}_ 2=\emptyset,\) then there is always an \(A_ i\) for which \(\| A_ i\cap {\mathcal S}_ 1| -| A_ i\cap {\mathcal S}_ 2\| >\sqrt{n},\) but there is an absolute constant k such that \({\mathcal S}_ 1\) and \({\mathcal S}_ 2\) can be chosen so that for every i, \(\| A_ i\cap {\mathcal S}_ 1| -| A_ i\cap {\mathcal S}_ 2\| <k\sqrt{n}.\) In other words the discrepancy of the set of lines of the finite geometry lies between \(\sqrt{n}\) and \(k\sqrt{n}\). Several other interesting problems are discussed.
- On colorings of finite projective planes
- Non-independent randomized rounding and coloring
- The discrepancy of a needle on a checkerboard
- Color Visualization of Blaschke Self-Mappings of the Real Projective Plan
- scientific article; zbMATH DE number 3823793 (Why is no real title available?)
- scientific article; zbMATH DE number 2039297 (Why is no real title available?)
- A spectral bound on hypergraph discrepancy
- Non-uniform lines on finite projective planes
This page was built for publication: Coloring the projective plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922552)
