Highly incident configurations with chiral symmetry (Q1953050)

A geometric \(k\)-configuration is a collection of \(n\) points and \(n\) lines with the property that each point lies on \(k\) lines and each line is incident with \(k\) points. The authors give an iterative algorithm for constructing \(k\)-configurations with non-trivial dihedral or chiral symmetry. While most similar constructions produce configurations with \(k =3\) or \(4\), this construction produces numerous configurations with \(k>4.\) For example, the method produces the only known infinite class of symmetric geometric 7-configurations, the second known infinite class of symmetric geometric 6-configurations and the only known 6-configurations with chiral symmetry. The authors also examine which parameters are valid to produce \(k\)-configurations.