New bounds on the existence of \((n_5)\) and \((n_6)\) configurations: the Grünbaum calculus revisited (Q2099675)

A geometric \((n_{k})\) configuration is a set of \(n\) points and \(n\) lines in the Euclidean plane such that each line passes through \(k\) points and dually each point lies on \(k\) lines. In [Art Discrete Appl. Math. 4, No. 3, Paper No. P3.14, 18 p. (2021; Zbl 1498.51004)], the authors showed that for every \(k\ge2\) there exists a number \(N_{k}\) such that for every \(n\ge N_{k}\) there exists a geometric \((n_{k})\) configuration. The authors prove that \(N_{5}\le 166\) and \(N_{6}\le585\), improving earlier results. The methods are based on the Grünbaum incidence calculus.