References
C. Bachoc, D. C. Gijswijt, A. Schrijver and F. Vallentin: Invariant semidef-inite programs, in: Handbook on semidefinite, conic and polynomial optimization (M. F. Anjos and J. B. Lasserre, eds.), Springer, New York, 2012, 219–269.
G. Brassard, R. Cleve and A. Tapp: Cost of exactly simulating quantum entanglement with classical communication, Phys. Rev. Lett. 83 (1999), 1874–1877.
H. Buhrman, R. Cleve and A. Widgerson: Quantum vs. classical communication and computation, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, USA, 1998, 63–68.
P. J. Cameron: Problems from CGCS Luminy, May 2007, European J. Combin. 31 (2010), 644–648.
P. Delsarte: An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl., No. 10, 1973.
N. J. Fine: Binomial coefficients modulo a prime, Amer. Math. Monthly 54 (1947), 589–592.
P. Frankl: Orthogonal vectors in the n-dimensional cube and codes with missing distances, Combinatorica 6 (1986), 279–285.
P. Frankl and V. Rödl: Forbidden intersections, Trans. Amer. Math. Soc. 300 (1987), 259–286.
V. Galliard: Classical pseudo-telepathy and colouring graphs, diploma thesis, ETH Zurich, 2001; available at https://doi.org/math.galliard.ch/Cryptography/Papers/PseudoTelepathy/SimulationOfEntanglement.pdf.
V. Galliard, A. Tapp and S. Wolf: The impossibility of pseudo-telepathy without quantum entanglement, in: Proceedings 2003 IEEE International Symposium on Information Theory, Yokohama, Japan, 2003.
D. C. Gijswijt, H. D. Mittelmann and A. Schrijver: Semidefinite code bounds based on quadruple distances, IEEE Trans. Inform. Theory 58 (2012), 2697–2705.
C. D. Godsil and M. W. Newman: Coloring an orthogonality graph, SIAM J. Discrete Math. 22 (2008), 683–692.
E. de Klerk and D. V. Pasechnik: A note on the stability number of an orthogonality graph, European J. Combin. 28 (2007), 1971–1979.
M. Laurent: Strengthened semidefinite programming bounds for codes, Math. Program. 109 (2007), 239–261.
M. W. Newman: Independent sets and eigenspaces, thesis, University of Waterloo, 2004.
A. Schrijver: New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (2005), 2859–2866.
Acknowledgments
We thank the anonymous referee for solving the case n=24.
Author information
Authors and Affiliations
Corresponding authors
Additional information
The first author is supported by a postdoctoral fellowship of the Research Foundation - Flanders (FWO)
The second author is supported by JSPS KAKENHI Grant Number JP17K05156.
Rights and permissions
About this article
Cite this article
Ihringer, F., Tanaka, H. The Independence Number of the Orthogonality Graph in Dimension 2k. Combinatorica 39, 1425–1428 (2019). https://doi.org/10.1007/s00493-019-4134-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-019-4134-9