Sharp Bounds for Sums Associated to Graphs of Matrices

Details Sharp Bounds for Sums Associated to Graphs of Matrices Sharp Bounds for Sums Associated to Graphs of Matrices

2009-09-23

arxiv.org/abs/0909.4277v1

Mathematics

Operator Algebras

20 pages

Scientific paper

We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices are constrained to be equal. The upper bound is easily obtained from a graph G associated to the constraints in the sum.

Affiliated with

Also associated with

No associations

Rating

Sharp Bounds for Sums Associated to Graphs of Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharp Bounds for Sums Associated to Graphs of Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp Bounds for Sums Associated to Graphs of Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182337