In Praise of the Gram Matrix

Moshe Rosenfeld ()
Additional contact information
Moshe Rosenfeld: Pacific Lutheran University, Department of Computer Science

A chapter in The Mathematics of Paul Erdős I, 2013, pp 551-557 from Springer

Abstract: 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 .

Keywords: Equiangular Lines; Seidel Matrix; Conference Matrix; Positive Semi-definite; Putnam Mathematical Competition (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_35

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_35

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().