Partitions of points into intersecting tetrahedra
β Scribed by Jean-Pierre Roudneff
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 361 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Reay has conjectured
that any set of (m -l)(d + 1) + k + 1 points in general position in Rd can be partitioned into m disjoint subsets S,, S,, ,
π SIMILAR VOLUMES
Tverberg's 1966 theorem asserts that every set X of (m -1)(d + 1) + 1 points in R d has a partition X 1 , X 2 , . . . , X m such that m i=1 conv X i = Ο. We give a short and elementary proof of a theorem on convex cones which generalizes this result. As a consequence, we deduce several divisibility
A longstanding conjecture of Reay asserts that every set X of (m-1)(d +1)+k+1 points in general position in R d has a partition X 1 , X 2 , . . . , X m such that m i=1 conv X i is at least k-dimensional. Using the tools developed in [13] and oriented matroid theory, we prove this conjecture for d =
The partitioning point dividing AK into AKo,, denoted/Cop, was determined for AI 7475-T7351 and the Ni-base alloy Nicrofer 5219 Nb annealed. The experimental testing technique used relies only on the fatigue crack, propagation behavior, i.e. whether a fatigue crack can propagate or can not propagate