arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0909.4277math.OAmath.CO
收藏

Sharp Bounds for Sums Associated to Graphs of Matrices

James A. Mingo, Roland Speicher

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑