On few-class Q-polynomial association schemes: feasible parameters and nonexistence results
From MaRDI portal
Publication:5156012
DOI10.26493/1855-3974.2101.b76zbMath1483.05203arXiv1908.10081OpenAlexW3107707247MaRDI QIDQ5156012
Alexander L. Gavrilyuk, Janoš Vidali, Jason S. Williford
Publication date: 14 October 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.10081
Related Items (3)
The search for small association schemes with noncyclotomic eigenvalues ⋮ Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials ⋮ Uniqueness of an association scheme related to the Witt design on 11 points
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Triple intersection numbers of \(Q\)-polynomial distance-regular graphs
- Extremal 1-codes in distance-regular graphs of diameter 3
- The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs
- Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes
- New families of \(Q\)-polynomial association schemes
- Imprimitive cometric association schemes: constructions and analysis
- Double covers of symplectic dual polar graphs
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- Some implications on amorphic association schemes
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
- Commutative association schemes
- Strongly regular graphs having strongly regular subconstituents
- On pseudo-automorphisms and fusions of an association scheme
- Amorphous association schemes over the Galois rings of characteristic 4
- Three-class association schemes
- The Magma algebra system. I: The user language
- Imprimitive Q-polynomial association schemes
- Tight distance-regular graphs
- Restrictions on classical distance-regular graphs
- Linked systems of symmetric designs
- Two distance-regular graphs
- Coherent configurations and triply regular association schemes obtained from spherical designs
- Using symbolic computation to prove nonexistence of distance-regular graphs
- A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
This page was built for publication: On few-class Q-polynomial association schemes: feasible parameters and nonexistence results
