Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-25T14:57:56.155Z Has data issue: false hasContentIssue false
  • English
  • Français

Sorting vectors

Published online by Cambridge University Press:  24 October 2008

Rollo Davidson
Rollo Davidson
Affiliation:
Trinity College, Cambridge
Get access Rights & Permissions [Opens in a new window]

Extract

1. Introduction: In what follows, X will be a real inner-product linear space (inner product (x, y), norm |x| = (x, x)½); En will be n-dimensional real Euclidean space. We shall be dealing with sets {as: 1 ≤ s ≤ rk; r ≥ 1, k ≥ 2} of elements of X; we write a for the vector (a1; …, ark), and put . We suppose that |as| ≤ ∈ (< 0) for every s.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 68 , Issue 1 , July 1970 , pp. 153 - 157
Copyright
Copyright © Cambridge Philosophical Society 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Cox, D. R. and Miller, H. D.The theory of stochastic processes (London: Methuen, 1965).Google Scholar
(2)Davidson, R.More Delphic theory and practice. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 13 (1969), 191–203.Google Scholar
(3)Rankin, R. A.The closest packing of spherical caps in n dimensions. Proc. Glasgow Math. Assoc. 2 (1955), 139–144.CrossRefGoogle Scholar