On the unlinking conjecture of independent polynomial functions

Abstract

The celebrated U-conjecture states that under the N n ( 0 , I n ) distribution of the random vector X = ( X 1 , … , X n ) in R n , two polynomials P ( X ) and Q ( X ) are unlinkable if they are independent [see Kagan et al., Characterization Problems in Mathematical Statistics, Wiley, New York, 1973]. Some results have been established in this direction, although the original conjecture is yet to be proved in generality. Here, we demonstrate that the conjecture is true in an important special case of the above, where P and Q are convex nonnegative polynomials with P ( 0 ) = 0 .