Intersecting hexagons in 3-space
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:I3Y4X6DErecord.jsonopen to challenge →
classification
math.MG
math.CO
keywords
hexagonsspaceassumptioncommonconsistsheavilyheavyinterior
read the original abstract
Two hexagons in the space are said to intersect heavily if their intersection consists of at least one common vertex as well as an interior point. We show that the number of hexagons on n points in 3-space without heavy intersections is o(n^2), under the assumption that the hexagons are "fat".
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.