Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T05:49:24.710Z Has data issue: false hasContentIssue false
  • English
  • Français

Primitive Radon partitions

Published online by Cambridge University Press:  26 February 2010

J. Eckhoff
J. Eckhoff
Affiliation:
Mathematisches Institut, Universität DOrtmund, Dortmund, Germany
Get access

Extract

Radon's theorem [8] asserts that, if X is a finite set of s points in Rd and s ≥ d + 2, then X admits a. Radon partition, that is, a partition {X1; X2} of X into disjoint subsets X1 and X2, such that

Type
Research Article
Information
Mathematika , Volume 21 , Issue 1 , June 1974 , pp. 32 - 37
Copyright
Copyright © University College London 1974

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

1.Breen, M.. “A determination of the combinatorial type of a polytope by Radon partitions”, Ph.D. Thesis (Clemson Univ., 1970).Google Scholar
2.Breen, M.. “Determining a polytope by Radon partitions”, Pacific J. Math., 43 (1972), 27–37.CrossRefGoogle Scholar
3.Eckhoff, J.. “Der Satz von Radon in konvexen Produktstrukturen I I”, Monatsh. Math., 73 (1969), 7–30.CrossRefGoogle Scholar
4.Eckhoff, J.. “Radonpartitionen und konvexe Polyeder”, j. reine angew. Math., to appear.Google Scholar
5.Grünbaum, B.. Convex polytopes (London–New York–Sydney, 1967).Google Scholar
6.Hare, W. R. and Kenelly, J. W.. “Characterization of Radon partitions”, Pacific J. Math., 36 (1971), 159–164.CrossRefGoogle Scholar
7.McMullen, P.. “The numbers of faces of simplicial polytopes”, Israel J. Math., 9(1971), 559–570.CrossRefGoogle Scholar
8.Radon, J.. “Mengen konvexer Korper, die einen gemeinsamen Punkt enthalten”, Math. Ann., 83(1921), 113–115.CrossRefGoogle Scholar
9.Shephard, G. C.. “Neighbourliness and Radon's theorem”, Mathematika, 16 (1969), 273–275.CrossRefGoogle Scholar