We consider the orthogonality graph (n) with 2n vertices corresponding to the vectors {0, 1}n, two vertices adjacent if and only if the Hamming distance between them is n/2. We show that, for n = 16, the stability number of (n) is ( (16)) = 2304, thus proving a conjecture by Galliard [7]. The main tool we employ is a recent semidefinite programming relaxation for minimal distance binary codes due to Schrijver [16]. Moreover, we give a general condition for Delsarte bound on the (co)cliques in graphs of relations of association schemes to coincide with the ratio bound, and use it to show that for (n) the latter two bounds are equal to 2n/n.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
66.