Sharp Bounds for Sums Associated to Graphs of Matrices
arXiv:0909.4277 · doi:10.1016/j.jfa.2011.12.010
Abstract
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.
20 pages
Cited by in corpus (10)
- On the Asymptotic Spectrum of Products of Independent Random Matrices
- New spectral relations between products and powers of isotropic random matrices
- On the asymptotic distribution of singular values of products of large rectangular random matrices
- Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
- Matrix denoising: Bayes-optimal estimators via low-degree polynomials
- Traffic distributions of random band matrices
- Rigid structures in the universal enveloping traffic space
- Asymptotic Freeness of Unitary Matrices in Tensor Product Spaces for Invariant States
- On the anti-commutator of two free random variables
- Fluctuation moments induced by conjugation with asymptotically liberating random matrix ensembles