Characterization Problems for Linear Forms with Free Summands

نویسنده

  • G. P. CHISTYAKOV
چکیده

Let T1, . . . , Tn denote free random variables. For two linear forms L1 = ∑n j=1 ajTj and L2 = ∑n j=1 bjTj with real coefficients aj and bj we shall describe all distributions of T1, . . . , Tn such that L1 and L2 are free. For identically distributed free random variables T1, . . . , Tn with distribution μ we establish necessary and sufficient conditions on the coefficients aj , bj , j = 1, . . . , n, such that the statements: (i) μ is a centered semicircular distribution; and (ii) L1 and L2 are identically distributed (L1 D = L2); are equivalent. In the proof we give a complete characterization of all sequences of free cumulants of measures with compact support and with a finite number of non zero entries. The characterization is based on topological properties of regions defined by means of the Voiculescu transform φ of such sequences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Sets Free of Sumsets with Summands of Prescribed Size

We study extremal problems about sets of integers that do not contain sumsets with summands of prescribed size. We analyse both finite sets and infinite sequences. We also study the connections of these problems with extremal problems of graphs and hypergraphs.

متن کامل

Multiplicative Complexity of Direct Sum of Quadratic Systems

We consider the quadratic complexity of certain sets of quadratic forms. We study classes of direct sums of quadratic forms. For these classes of problems we show that the complexity of one direct sum is the sum of the complexities of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm.

متن کامل

MONOMIALS AS SUMS OF k-POWERS OF FORMS

Motivated by recent results on the Waring problem for polynomial rings [FOS12] and representation of monomial as sum of powers of linear forms [CCG12], we consider the problem of presenting monomials of degree kd as sums of kth-powers of forms of degree d. We produce a general bound on the number of summands for any number of variables which we refine in the two variables case. We completely so...

متن کامل

Gaussian Behavior in Generalized Zeckendorf Decompositions

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers {Fn}n=1; Lekkerkerker proved that the average number of summands for integers in [Fn,Fn+1) is n/(φ2 + 1), with φ the golden mean. This has been generalized to certain classes of linear recurrence relations, where using techniques from number theory and ergodic theory...

متن کامل

A New Sigma Approach to Multi-summation

We present a general algorithmic framework that allows not only to deal with summation problems over summands being rational expressions in indefinite nested sums and products (Karr 1981), but also over ∂-finite and holonomic summand expressions that are given by a linear recurrence. This approach implies new computer algebra tools implemented in Sigma to solve multi-summation problems efficien...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011