arXiv · 2610.08893
A symmetric conference matrix of order 86
Abstract
We construct a symmetric conference matrix of order $86$, the smallest order for which existence was open. Equivalently, there exist a conference graph with parameters $(85,42,20,21)$, a regular two-graph on $86$ points, and a real equiangular tight frame of $86$ vectors in $\mathbb{R}^{43}$. The matrix is a $12\times12$ array of $7\times7$ circulants with two border rows, and it admits a group of automorphisms of order $21$. Its $86$ descendants give exactly ten nonisomorphic strongly regular graphs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Harshit Verma. 2026-10-06. A symmetric conference matrix of order 86. https://searcharxiv.com/abs/2610.08893
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.