On lines and Joints
Abstract
Let L be a set of n lines in d, for d 3. A joint of L is a point incident to at least d lines of L, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum possible number of joints of L is (nd/(d-1)). For d=3, this is a considerable simplification of the orignal algebraic proof of Guth and Katz~GK, and of the follow-up simpler proof of Elekes et al. EKS.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.