arXiv (All)
open access
A symmetric conference matrix of order 86
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 ma
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds#1297466
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
- Strengthened upper bound on the third eigenvalue of graphs#1141400
- Maximization of the first Laplace eigenvalue of a finite graph II#971672
- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133
Record · ID 1232932
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive