论文信息 - The joints problem in R^n

The joints problem in R^n

We show that given a collection of A lines in \R^n, n\geq 2, the maximum number of their joints (points incident to at least n lines whose directions form a linearly independent set) is O(A^{n/(n-1)}). An analogous result for smooth algebraic curves is also proven.

R. Quilodran | RENÉ QUILODRÁN

[1] Haim Kaplan,et al. On lines, joints, and incidences in three dimensions , 2009, J. Comb. Theory, Ser. A.

[2] T. Willmore. Algebraic Geometry , 1973, Nature.

[3] Larry Guth,et al. Algebraic methods in discrete analogs of the Kakeya problem , 2008, 0812.1043.

[4] Haim Kaplan,et al. On Lines and Joints , 2009, Discret. Comput. Geom..

[5] C. Wampler,et al. Basic Algebraic Geometry , 2005 .

[6] Larry Guth,et al. The endpoint case of the Bennett–Carbery–Tao multilinear Kakeya conjecture , 2008, 0811.2251.

[7] Zeev Dvir,et al. On the size of Kakeya sets in finite fields , 2008, 0803.2336.