Consider this statement: "Chebyshev polynomials increase in magnitude more quickly outside the range $[−1,1]$ than any other polynomial that is restricted to have magnitude no greater than one inside the range $[−1,1]$."
In the multivariate case, is there a degree $d$ polynomial that lies in $[-1,1]$ in the interval $[-1,1]^n$ and grows faster than any other polynomial of degree $d$ outside the $[-1,1]^n$? If so, what is this polynomial? It is natural to conjecture that $q(x_1,..,,x_n) = T_{d/n}(x_1)T_{d/n}(x_2)..T_{d/n}(x_n)$ (assuming $n|d$) is this polynomial ($T_i(x)$ is the degree $i$ Chebyshev polynomial).
For the univariate case, a proof can be found here.
I have tried to generalize this proof to the bivariate case, but the fact that bivariate polynomials can have infinitely many roots (while univariate polynomials can have only at most degree-many roots) seems to be a barrier in adapting the proof.
Consider the 2D case, and the line $x=x_0$, for $x_0 \in (-1,1)$. Along that line, the fastest growing polynomial is a Chebyshev polynomial.
A Chebyshev polynomial in $y$ multiplied by $f(x)=1$ will make a "multivariate" polynomial that is in $[-1,1]$ in the unit box, and grows faster than any polynomial on $[-1,1] \times ((-\infty,-1) \cup(1,\infty))$.
However, this polynomial grows much more poorly outside of that region.
I think you need to relax your definition of growth. No single multivariate polynomial will grow most quickly everywhere.