Skip to main content
Log in

Sets of vectors with many orthogonal paris:

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

What is the most number of vectors inR d such that anyk+1 contain an orthogonal pair? The 24 positive roots of the root systemF 4 inR 4 show that this number could exceeddk.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Frankl, P.: Orthogonal vectors in then-dimensional cube and codes with missing distances,Combinatorica 6, 279–285 (1986)

    MATH  MathSciNet  Google Scholar 

  2. Frankl, P., Rödl, V.: Forbidden intersections,Trans. Amer. Math. Soc. 300, 259–286 (1987)

    MathSciNet  Google Scholar 

  3. Graham, R.L., Rothschild, B.L., Spencer, J.:Ramsey Theory, Wiley Interscience, 1980. (2nd edition 1990)

  4. Larman, D.G., Rogers, C.A.: The realization of distances whithin sets in eucledian space,Mathematika 19, 1–24 (1972)

    MathSciNet  Google Scholar 

  5. Moshe Rosenfeld, Almost orthogonal lines, inE d, DIMACS Series in Discrete Math.4, 489–492 (1991)

Download references

Author information

Authors and Affiliations

Authors

Additional information

The research was done while the author Z. Füredi visited the Department of Mathematics at Massachusetts Institute of Technology. Research supported in part by the Hungarian National Science Foundation under grant No. 1812. Research supported in part by NSF grants.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Füredi, Z., Stanley, R. Sets of vectors with many orthogonal paris:. Graphs and Combinatorics 8, 391–394 (1992). https://doi.org/10.1007/BF02351595

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02351595

Keywords

Navigation