Let $f_{a,n}(x_1,x_2)$ be a polynomial in $\mathbb{F}_p[x_1,x_2]$, where $\mathbb{F}_p$ is a finite field or oder $p$ (perhaps, we may first assume that $p$ is prime) depending on $a\in\mathbb{F}_p$ and an integer $1\le n\le p-1$. Let $f_{a,n}$ be defined as follows as $f_{a,n}(x_1,x_2) := ax_1^n - x_1 x^n_2$. I am trying to investigate the following question: for what $a$ and $n$ is the polynomial $f_{a,n}$ surjective as a function from $\mathbb{F}_p\times\mathbb{F}_p$ to $\mathbb{F}_p$.
As the question seems rather difficult, let us first concentrate on the case when $n = 3$, $a = 1$. It appears that the polynomial $f = f_{1,3} = x_1^3-x_1 x_2^3$ is surjective over any field of odd (not necessarily prime) characteristics $\mathbb{F}_p$, $3\le p\le 1000$, $p\neq 19$. I would like to understand the number theory behind this result. Why is the case $p = 19$ special or 'exceptional'? It is interesting to note that for all other values of $3 \le p \le 1000$, $p$ odd, the polynomial $f_{a,3}=a x_1^3-x_1 x_2^3$ is surjective for any $a\in\mathbb{F}_p$! (this is not $p!$, it is me being astinoshed by this result).
For other combinations of $a$ and $n$ there are also such 'exceptional' values of $p$.
Does anyone know if polynomials of the type $x^3-xy^3$ have been studied over finite fields?
As noted above, $f_{a,3}$ is onto when $p\not\equiv 1\pmod 9$. If $p\not\equiv 1\pmod 3$ then ever element of $\mathbb F_p$ is a perfect cube, so we can find a solution with $x_2=0$.
When $p\equiv 1\pmod 3$ and $p\not\equiv 1\pmod 9$, we get a primitive cube root of unity, $\zeta^3=1$ in $\mathbb F_p$, and $\zeta$ itself is not a cube.
Then for any $z\in\mathbb F_p$, one of the following is a perfect cube: $$z-a,\frac{z-a}{\zeta},\frac{z-a}{\zeta^2}$$
In which case we can pick $x=1,x=\zeta,$ or $x=\zeta^2$, respectively and find a solution.
In general, $z\neq 0$ is in the image of $f_{a,3}$ if and only if $\frac{z-ax^3}{x}$ is a cube for some $x\neq 0$. If it was purely random whether that value was a cube, it would be highly unlikely that there were any such $z$ when $p$ is large. That's not a rigorous argument, just a heuristic one.
So I suspect that the reason $19$ is a counter-example is that $19\equiv 1\pmod 9$ and $19$ is small.
One other thing to note is that if $z$ is not in the image and $w\in\mathbb F_p^\times$ then $w^9z$ is also not in the image. Because if $w^9z=ax^3-y^3x$ then $$z=a(xw^{-3})^2-(yw^{-2})^3(xw^{-3})$$
This means that for any $p\equiv 1\pmod 9$ we only actually have to check $6$ values for $z$ (because three of the nine equivalence classes in $\mathbb F_p^\times/(\mathbb F_p^\times)^9$ are cubes, and we know those are okay.)