English

An example of an "unlinked" set of $2k + 3$ points in $2k$-space

Combinatorics 2024-02-15 v1 Metric Geometry

Abstract

Take any d+3d + 3 points in Rd\mathbb{R}^d. It is known that (a) if d=2k+1d = 2k + 1, then there are two linked (k+1)(k + 1)-simplices with the vertices at these points; (b) if d=2kd = 2k, then there are two disjoint (k+1)(k + 1)-tuples of these points such that their convex hulls intersect. The analogue of (b) for d=2k+1d = 2k + 1, which is also the analogue of (a) for intersections (instead of linkings), states that there are two disjoint (k+1)(k + 1)- and (k+2)(k + 2)-tuples of these points such that their convex hulls intersect. This analogue is correct by (a).

Keywords

Cite

@article{arxiv.2402.09002,
  title  = {An example of an "unlinked" set of $2k + 3$ points in $2k$-space},
  author = {M. Starkov},
  journal= {arXiv preprint arXiv:2402.09002},
  year   = {2024}
}

Comments

3 pages