On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture (Q1658759): Difference between revisions

Summary: Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean \(d\)-space that guarantees that any such point set admits a partition into \(r\) parts, any \(k\) of whose convex hulls intersect. Here we give new and improved lower bounds for this number, which Reay conjectured to be independent of \(k\). We prove a colored version of Reay's conjecture for \(k\) sufficiently large, but nevertheless \(k\) independent of dimension \(d\). Pairwise intersecting convex hulls have severely restricted combinatorics. This is a higher-dimensional analogue of Conway's thrackle conjecture or its linear special case. We thus study convex-geometric and higher-dimensional analogues of the thrackle conjecture alongside Reay's problem and conjecture (and prove in two special cases) that the number of convex sets in the plane is bounded by the total number of vertices they involve whenever there exists a transversal set for their pairwise intersections. We thus isolate a geometric property that leads to bounds as in the thrackle conjecture. We also establish tight bounds for the number of facets of higher-dimensional analogues of linear thrackles and conjecture their continuous generalizations.