• DOI:10.1007/S10801-013-0459-4
Corpus ID: 43862048

Tightness in subset bounds for coherent configurations

@article{Hobart2014TightnessIS,
  title={Tightness in subset bounds for coherent configurations},
  author={S. Hobart and Jason Williford},
  journal={Journal of Algebraic Combinatorics},
  year={2014},
  volume={39},
  pages={647-658}
}

S. Hobart, Jason Williford

Published 2014

Mathematics

Journal of Algebraic Combinatorics

Association schemes have many applications to the study of designs, codes, and geometries and are well studied. Coherent configurations are a natural generalization of association schemes, however, analogous applications have yet to be fully explored. Recently, Hobart [Mich. Math. J. 58:231–239, 2009] generalized the linear programming bound for association schemes, showing that a subset Y of a coherent configuration determines positive semidefinite matrices, which can be used to constrain… CONTINUE READING

View on Springer

link.springer.com

Save to Library

Create Alert

Cite

Launch Research Feed