English

Unlinking Theorem for Symmetric Quasi-convex Polynomials

Probability 2021-01-01 v1

Abstract

Let μn\mu_n be the standard Gaussian measure on Rn\mathbb{R}^n and XX be a random vector on Rn\mathbb{R}^n with the law μn\mu_n. U-conjecture states that if ff and gg are two polynomials on Rn\mathbb{R}^n such that f(X)f(X) and g(X)g(X) are independent, then there exist an orthogonal transformation LL on Rn\mathbb{R}^n and an integer kk such that fLf\circ L is a function of (x1,,xk)(x_1,\cdots,x_k) and gLg\circ L is a function of (xk+1,,xn)(x_{k+1},\cdots,x_n). In this case, ff and gg are said to be unlinked. In this note, we prove that two symmetric, quasi-convex polynomials ff and gg are unlinked if f(X)f(X) and g(X)g(X) are independent.

Keywords

Cite

@article{arxiv.2012.14568,
  title  = {Unlinking Theorem for Symmetric Quasi-convex Polynomials},
  author = {He-Jing Hong and Ze-Chun Hu},
  journal= {arXiv preprint arXiv:2012.14568},
  year   = {2021}
}

Comments

7 pages

R2 v1 2026-06-23T21:32:00.356Z