Some remarks on non-symmetric polarization
arXiv:1806.03230 · doi:10.1016/j.jmaa.2018.06.067
Abstract
Let be an -homogeneous polynomial given by \[P(x)= \sum_{1\leq j_1\leq \ldots \leq j_m \leq n} c_{j_1 \ldots j_m} x_{j_1}\ldots x_{j_m}.\] Defant and Schlüters defined a non-symmetric associated -form by \[L_P \left(x^{(1)},\ldots,x^{(m)} \right)= \sum_{1\leq j_1\leq \ldots \leq j_m \leq n} c_{j_1 \ldots j_m} x_{j_1}^{(1)}\ldots x_{j_m}^{(m)}.\] They estimated the norm of on by the norm of on times a factor for every 1-unconditional norm on . A symmetrization procedure based on a card-shuffling algorithm which (together with Defant and Schlüters' argument) brings the constant term down to is provided. Regarding the lower bound, it is shown that the optimal constant is bigger than when . Finally, the case of -norms with is addressed.