Unlinking Theorem for Symmetric Quasi-convex Polynomials

preprint2020arXivOpen access

Abstract

Let μnμ_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μ_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 f∘Lf\circ L is a function of (x1,⋯ ,xk)(x_1,\cdots,x_k) and g∘Lg\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.