Tightness in subset bounds for coherent configurations

DOI10.1007/s10801-013-0459-4zbMath1291.05228OpenAlexW1984419250MaRDI QIDQ2454083

Sylvia A. Hobart, Jason S. Williford

Publication date: 12 June 2014

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-013-0459-4

zbMATH Keywords

association schemefinite geometrycoherent configurationDelsarte bound

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

\(Q\)-polynomial coherent configurations ⋮ Algebras, graphs and thetas ⋮ New and updated semidefinite programming bounds for subspace codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The independence number for polarity graphs of even order planes
• Bounds on subsets of coherent configurations
• Coherent algebras
• Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)]
• Maximal arcs in Desarguesian planes of odd order do not exist
• Antidesigns and regularity of partial spreads in dual polar graphs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• More maximal arcs in Desarguesian projective planes and their geometric structure