The absolute bound for coherent configurations

DOI10.1016/j.laa.2013.10.045zbMath1292.05275OpenAlexW2086667284MaRDI QIDQ2442217

Jason S. Williford, Sylvia A. Hobart

Publication date: 2 April 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.10.045

zbMATH Keywords

association schemecoherent configurationabsolute bound

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

\(Q\)-polynomial coherent configurations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Diophantine equation arising from tight 4-designs
• Distance regular graphs of diameter 3 and strongly regular graphs
• Bounds on subsets of coherent configurations
• Coherent algebras
• Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)]
• 2-designs having an intersection number \(k-n\)
• Coherent configurations. I: Ordinary representation theory
• On t-designs
• Tight 4-designs
• Krein conditions for coherent configurations
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming

This page was built for publication: The absolute bound for coherent configurations