On tight 4-designs in Hamming association schemes
From MaRDI portal
Publication:2216921
DOI10.1007/s00493-019-4115-zzbMath1463.05541arXiv1809.07553OpenAlexW3010010632MaRDI QIDQ2216921
Sho Suda, Alexander L. Gavrilyuk, Janoš Viladi
Publication date: 18 December 2020
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07553
Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (3)
\(Q\)-polynomial coherent configurations ⋮ Euclidean designs obtained from spherical embedding of coherent configurations ⋮ Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Imprimitive cometric association schemes: constructions and analysis
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\)
- Strongly regular graphs having strongly regular subconstituents
- On t-designs
- Spherical codes and designs
- Tight spherical designs. I
- Orthogonal arrays. Theory and applications
- On existence of two symbol complete orthogonal arrays
- Tight distance-regular graphs
- Restrictions on classical distance-regular graphs
- Nonexistence of nontrivial tight 8-designs
- Coherent configurations and triply regular association schemes obtained from spherical designs
- Using symbolic computation to prove nonexistence of distance-regular graphs
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
- Tight Spherical Disigns, II
- On Orthogonal Arrays of Strength 4 Achieving Rao's Bound
- ON TIGHT DESIGNS
- Bounds for orthogonal arrays with repeated rows
This page was built for publication: On tight 4-designs in Hamming association schemes
