arXiv · 2611.17855
On configurations that are nearly generalised polygons
Abstract
Payne (1972) introduced nearly generalised $n$-gons as $(s+1)$-regular bipartite graphs of girth $2n$ with small excess over the Moore bound. Biggs and Ito (1980) proved nonexistence of such graphs if $s > 1$ and $n > 3$, leaving open the existence of regular antipodal planes. We revisit this problem from several equivalent viewpoints. First we show that a regular antipodal plane of order $s$ is equivalent to a balanced weighing matrix whose support is the incidence matrix of a biplane with parameters \[ 2-\left(\frac{s^2+s+2}{2},\,s+1,\,2\right). \] This gives short determinant and local-arithmetic obstructions to existence. We then formulate the question of signing a biplane as an affine linear system over $\mathbb F_2$, and use this formulation to prove that no regular antipodal plane of order $s$ exists with $4\le s\le 14$. Finally, we give further equivalent formulations in terms of sharply deranged families of permutations and mutually orthogonal array-bic squares. These translations provide new computational and structural approaches to Payne's conjecture that regular antipodal planes exist only for $s=2,3$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sam Adriaensen, John Bamberg, Jason Williford. 2026-11-13. On configurations that are nearly generalised polygons. https://searcharxiv.com/abs/2611.17855
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.