Sharp bounds for sums associated to graphs of matrices (Q765924)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6017643
Language Label Description Also known as
default for all languages
No label defined
    English
    Sharp bounds for sums associated to graphs of matrices
    scientific article; zbMATH DE number 6017643

      Statements

      Sharp bounds for sums associated to graphs of matrices (English)
      0 references
      0 references
      0 references
      22 March 2012
      0 references
      The authors find a sharp upper bound for sums of products of matrix entries of the form \[ S_\pi (N)=\sum_{j_1,\dots, j_{2m}=1,ker (j)\geq \pi}^N t^{(1)}_{j_1j_2}\dots t^{(m)}_{j_{2m-1}j_{2m}} \] in terms of product of operator norms. The problem is motivated by random matrix questions and the solution uses graph theory.
      0 references
      random matrices
      0 references
      graph of matrices
      0 references
      graph sum
      0 references
      products of matrix entries
      0 references
      product of operator norms
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references