TITLE: On the joints problem in finite fields
QUESTION [6 upvotes]: The original version of the so-called "joints problem" consists of the following:
Let $L$ be a set of lines in $\mathbb{R}^{3}$. Determine the maximum number of "joints" determined by these lines, where by joint we understand a point of $\mathbb{R}^{3}$ lying on three lines from the set $L$ but which do not all lie in the same plane (i.e. they are non-coplanar).
The conjectured answer by Sharir was that this number of joints is $\leq C |L|^{\frac{3}{2}}$, for some positive constant $C$; this was proven by Guth and Katz using a rather simple polynomial mathod which easily generalies to $\mathbb{R}^{d}$ in which case the upper bound becomes $C |L|^{\frac{d}{d-1}}$. (references can be found very easily on google; for example, see http://www.dagstuhl.de/Materials/Files/09/09111/09111.SharirMicha.Other.pdf)
Now, it seems to me that this polynomial method does not generalize to finite fields; so, my question is, can we get some upper bound in this case? My thoughts for now are to use the graph $G$ having as vertices the lines and to connected them if the lines intersect. Then the number of joints is the number of triangles of $G$ minus $\frac{1}{2}\left(\binom{|L|}{2} - k\right)$, where $k$ is the number of distinct planes determined by the $|L|$ lines... but I feel that I'll be getting really weak bounds if I majorize this (using graph theoretic stuff about the number of triangles and Beck's theorem or related things for $k$).
So, any other ideas or knowledge about the finite field case in literature?
Thanks.

REPLY [3 votes]: I know I'm digging up an old thread, but I figured out how to extend Kaplan, Sharir and Shustin's proof (similar to Quilodran's proof) to finite fields last summer, then later realized that Dvir indicates the proof in a set of lecture notes.
Anyway, the trick is this: if $Q$ is a polynomial over $\mathbb{F}_q[x_1,...,x_n]$ whose gradient vanishes identically, then $Q$ is the $p$th power of some other polynomial $Q_1$ (where $q$ is a power of $p$). Since $Q_1$ is zero if and only if $Q_1^p$ is zero, if we're assuming that $Q$ is the minimum degree polynomial that vanishes on the set of lines forming our joints, we get a contradiction.
Dvir mentions how to do this in his lecture notes: http://www.cs.princeton.edu/~zdvir/teaching/incidence12/6.%20The%20polynomial%20method.pdf
I couldn't get Hasse derivatives to work, but it might be possible. I forgot what the trouble was with them.