Imprimitive cometric association schemes: constructions and analysis
From MaRDI portal
Publication:884813
DOI10.1007/s10801-006-0043-2zbMath1118.05100OpenAlexW2067432723MaRDI QIDQ884813
William J. Martin, Mikhail E. Muzychuk, Jason S. Williford
Publication date: 7 June 2007
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-006-0043-2
Related Items (23)
\(Q\)-polynomial coherent configurations ⋮ Unit gain graphs with two distinct eigenvalues and systems of lines in complex space ⋮ New families of \(Q\)-polynomial association schemes ⋮ On the connectivity of graphs in association schemes ⋮ Double covers of symplectic dual polar graphs ⋮ Linking systems in nonelementary abelian groups ⋮ Coherent configurations and triply regular association schemes obtained from spherical designs ⋮ A characterization of \(Q\)-polynomial association schemes ⋮ On tight 4-designs in Hamming association schemes ⋮ Linked systems of symmetric designs ⋮ Characterizations of regularity for certain \(Q\)-polynomial association schemes ⋮ Linked systems of symmetric group divisible designs ⋮ On few-class Q-polynomial association schemes: feasible parameters and nonexistence results ⋮ On the isomorphism of certain primitive \(Q\)-polynomial not \(P\)-polynomial association schemes ⋮ On the equivalence between real mutually unbiased bases and a certain class of association schemes ⋮ Hemisystems of \(\mathcal{Q}(6,q)\), \(q\) odd ⋮ Mutually unbiased bush-type Hadamard matrices and 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 ⋮ Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg} ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Commutative association schemes ⋮ Perfect state transfer on distance-regular graphs and association schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The subconstituent algebra of an association scheme. I
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- Spherical codes and designs
- Three-class association schemes
- Imprimitive Q-polynomial association schemes
- Width and dual width of subsets in polynomial association schemes
- Association schemes related to Kasami codes and Kerdock sets
- Twice Q-polynomial distance-regular graphs are thin
- On homogeneous systems of linked symmetric designs
- On groups with several doubly-transitive permutation representations
- Antipodal covering graphs
This page was built for publication: Imprimitive cometric association schemes: constructions and analysis
