Skip to main content

In Praise of the Gram Matrix

  • Chapter
  • First Online:
The Mathematics of Paul Erdős I
  • 2280 Accesses

Summary

We use the Gram matrix to prove that the largest number of points in R d such that the distance between all pairs is an odd integer (the square root of an odd integer) is ≤ d + 2 and we characterize all dimensions d for which the upper bound is attained. We also use the Gram matrix to obtain an upper bound for the smallest angle determined by sets of n lines through the origin in R d.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. V. Belevitch, Conference networks and Hadamard matrices, Ann. Soc. Sci. Bruxelles, Ser. I 82 (1968), pp. 13–32.

    Google Scholar 

  2. L. Danzer, Finite point-sets on S 2, Discrete Mathematics, Vol. 60 (1986), pp. 3–66.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. L. Graham, B. L. Rothschild and E. G. Strauss, Are there n + 2 points in E n with odd integral distances? Amer. Math. Monthly, 81 (1974), pp. 21–25.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. S. Kashin and S. V. Konyagin, On systems of vectors in a Hilbert space, Proceedings of the Steklov Institute of Mathematics (AMS Translation) 1983, Issue 3, pp. 67–70.

    Google Scholar 

  5. P. W. H. Lemmens and J. J. Seidel, Equiangular lines, J. of algebra 24 (1973), pp. 494–512.

    Article  MathSciNet  MATH  Google Scholar 

  6. J. H. van Lint and J. J. Seidel, Equilateral points sets in elliptic geometry, Proc. Kon. Nederl. Akad. Wet., Ser. A, 69 (1966), pp. 335–348.

    Google Scholar 

  7. Raphael M. Robinson, Arrangement of 24 points on a sphere, Math. Annalen 144 (1961), pp. 17–48.

    Article  MATH  Google Scholar 

  8. Raphael M. Robinson, Finite sets of points on a sphere with each nearest to five others, Math. Annalen 1979 (1969), pp. 296–318.

    Article  Google Scholar 

  9. M. Rosenfeld, Almost orthogonal lines in E d, Applied Geometry and Discrete Mathematics, The “Victor Klee Festschrift,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 4 (1991), pp. 489–492.

    MathSciNet  Google Scholar 

  10. B. Weisfeiler, On construction and identification of graphs, Lecture Notes 558, Springer-Verlag (1976).

    Google Scholar 

Download references

Acknowledgements

The author is indebted to Branko Grünbaum and Victor Klee for helpful discussions during preparation of this note.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Moshe Rosenfeld .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Rosenfeld, M. (2013). In Praise of the Gram Matrix. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_35

Download citation

Publish with us

Policies and ethics