Nonexistence of exceptional imprimitive Q-polynomial association schemes with six classes
From MaRDI portal
Publication:616370
DOI10.1016/J.EJC.2010.09.006zbMATH Open1291.05230arXiv1005.3598OpenAlexW2082110564MaRDI QIDQ616370FDOQ616370
Authors: Hajime Tanaka, Rie Tanaka
Publication date: 7 January 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Suzuki (1998) showed that an imprimitive Q-polynomial association scheme with first multiplicity at least three is either Q-bipartite, Q-antipodal, or with four or six classes. The exceptional case with four classes has recently been ruled out by Cerzo and Suzuki (2009). In this paper, we show the nonexistence of the last case with six classes. Hence Suzuki's theorem now exactly mirrors its well-known counterpart for imprimitive distance-regular graphs.
Full work available at URL: https://arxiv.org/abs/1005.3598
Recommendations
- Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- Imprimitive Q-polynomial association schemes
- The structure of imprimitive non-symmetric 3-class association schemes
- New families of \(Q\)-polynomial association schemes
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey on spherical designs and algebraic combinatorics on spheres
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
- There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
- There are only finitely many distance-regular graphs of fixed valency greater than two
- Commutative association schemes
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- Imprimitive Q-polynomial association schemes
Cited In (6)
- Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
- Twice \(Q\)-polynomial distance-regular graphs of diameter 4
- On the connectivity of graphs in association schemes
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry
- On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
This page was built for publication: Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616370)