On the unlinking conjecture of independent polynomial functions
The celebrated U-conjecture states that under the Nn(0,In) distribution of the random vector X=(X1,...,Xn) in , 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.
Volume (Year): 97 (2006)
Issue (Month): 6 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:97:y:2006:i:6:p:1355-1360. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.