Ordering Points by Linear Functionals
β Scribed by Paul H. Edelman
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 102 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
Given a set of points in Euclidean space, we say that two linear functionals differ on that set if they give rise to different linear orderings of the points. We investigate what the largest and smallest number of different linear functionals can be as a function of the number of points and the dimension of the space.
π SIMILAR VOLUMES
## Abstract A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear orderβtypes for which each computable model has a computable choice set, and a full characterization i
Suppose that n competitors participate in r races so that each competitor obtains a result consisting of r platings. The set of all possible results can be given a lattice structure. This structure is a partially ordered set with the notion of dimension defined in terms of linear orders which extend
We consider an inΓΏnite sequence X 1 ; X 2 ; : : : of independent random variables having a common continuous distribution function F(x). For 1 6 i 6 n, let {X i:n } denote the ith order statistic among X 1 ; : : : ; X n . In this paper, we characterize the distributions for which the regression E((X