Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T02:48:39.952Z Has data issue: false hasContentIssue false

Sorting vectors

Published online by Cambridge University Press:  24 October 2008

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

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1970