A combinatorial perspective on the Radon convexity theorem
β Scribed by T. H. Brylawski
- Publisher
- Springer
- Year
- 1976
- Tongue
- English
- Weight
- 324 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
β¦ Synopsis
Matroid-theoretic methods are employed to compute the number of complementary subsets of points of a set S whose convex hulls intersect (a number Radon proved to be nonzero when S has an affme dependency). This number is shown to be an invariant only of the dependence structure of S. Strict bounds are given depending on the cardinality and dimension of S and the number is related to other matroid invariants.
π SIMILAR VOLUMES
We raise a conjecture which would generalize Radon's theorem and would provide combinatorial proof for the result from [7], which generalizes Rado's theorem on general measure and the Ham sandwich theorem. We prove that the conjecture holds in several particular cases.
In the present work, we give a proof of the injectivity of the combinatorial Radon transform of order five.