Re: Pascal Triangle/binomial numbers
- From: "Bill" <Bill_NOSPAM@xxxxxxxxxxx>
- Date: Sat, 8 Dec 2007 02:33:40 -0500
I got the solution, I think, using a Cholesky decomposition.
"Bill" <Bill_NOSPAM@xxxxxxxxxxx> wrote in message
news:75KdnfIv2-yk3cfanZ2dnUVZ_qelnZ2d@xxxxxxxxxxxxxx
From the "upper diamond" of Pascal's Triangle ("tilt your head 45
degrees", if necessary), construct the square matrices:
A_1 = { [1] },
A_2 = { [1, 1], [1, 2] },
A_3 = { [1, 1, 1], [1, 2, 3], [1, 3, 6] },
etc.
I am trying to show that each of these matrices A_n, n = 1, 2, 3, ...
are positive semi-definite. Calculations suggest that they are. I would
appreciate any suggestions or references that may be of help. I am hoping
that if I look at things the right way, that it will be obvious.
Thanks,
Bill
.
- References:
- Pascal Triangle/binomial numbers
- From: Bill
- Pascal Triangle/binomial numbers
- Prev by Date: #411 largest triangle on a sphere?; new textbook: "Mathematical-Physics (p-adic primer) for students of age 6 onwards"
- Next by Date: Re: Finding the inverf
- Previous by thread: Pascal Triangle/binomial numbers
- Next by thread: Re: Pascal Triangle/binomial numbers
- Index(es):