Yes, it is true. Every polynomial does have a decomposition like you ask for, with restrictions.

To explain why this is the case, first suppose that $p$ is homogeneous of degree $d$, and we seek a decomposition where each linear form $L_i$ is a homogeneous linear form (no constant term) and each power $k_i = d$. The projective variety whose points are $L^d$ for linear forms $L$, up to scalar multiple, is the Veronese variety. It's an irreducible variety, and it's nondegenerate, meaning that it's not contained in any hyperplane. If remove any proper subvariety, then what's left is still not contained in any hyperplane because it's dense in the whole Veronese variety (assuming the ground field is infinite). Your restrictions correspond to proper subvarieties. So, this argument shows that you can impose any finite number of your nonvanishing restrictions and the $L^d$'s that remain are still sufficient to span all the degree $d$ homogeneous polynomials.

If $p$ isn't homogeneous you can simply decompose each of its homogeneous parts separately.

A reference for this is:

- Białynicki-Birula, Schinzel,
*Representations of multivariate polynomials by sums of univariate polynomials in linear forms*, Colloq. Math. 112 (2008), no. 2, 201–233. (MR2383331, Zbl 1154.11011)

A more general version (working with restrictions to any open set of the space of linear forms, not just complements of hyperplanes) is:

- Jelisiejew,
*An upper bound for the Waring rank of a form*, Arch. Math. (Basel) 102 (2014), no. 4, 329–336. (MR3196960, Zbl 1322.14079)

Both of these references are more concerned with giving an upper bound for the number of terms needed in a decomposition, so they don't spend much time on the existence of a decomposition.

A few minor notes in closing:

The number of terms in a decomposition of a nonhomogeneous polynomial can (at least sometimes) be decreased if we allow nonhomogeneous linear forms. The common examples are things like $(x+1)^n-x^n$, a polynomial of degree $n-1$, which requires much more than $2$ terms if it is decomposed in powers $k_i \leq n-1$.

Białynicki-Birula and Schinzel have a hypothesis that the leading form of the polynomial should depend essentially on all of the variables. That doesn't matter if all you're asking for is existence of a decomposition (it matters if you want decompositions with minimal number of terms). If the leading term were, say, $x_1^d$, and you wanted to decompose in terms $L_i^d$ where $L_i(p) \neq 0$, but $x_1(p)=0$, then you couldn't use $x_1$ as one of the $L_i$, and you'd have to use a very non-minimal decomposition involving stuff like $(x_1 + a x_2)^d$ for several values of $a$. Anyway, the point is, if you don't worry about minimality then don't worry about that hypothesis in their paper.