Displaying 41 – 60 of 80

Showing per page

The random paving property for uniformly bounded matrices

Joel A. Tropp (2008)

Studia Mathematica

This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison-Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in comparison with its dimension can be paved by a partition of constant size. That is, the coordinates can be partitioned into a constant number of blocks so that the restriction of the matrix to each block of coordinates has norm less than one half. The original proof of...

The rate of convergence for spectra of GUE and LUE matrix ensembles

Friedrich Götze, Alexander Tikhomirov (2005)

Open Mathematics

We obtain optimal bounds of order O(n −1) for the rate of convergence to the semicircle law and to the Marchenko-Pastur law for the expected spectral distribution functions of random matrices from the GUE and LUE, respectively.

The reciprocal super Catalan matrix

Helmut Prodinger (2015)

Special Matrices

The reciprocal super Catalan matrix has entries [...] . Explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, q-analogues are also presented.

The Smith normal form of product distance matrices

R. B. Bapat, Sivaramakrishnan Sivasubramanian (2016)

Special Matrices

Let G = (V, E) be a connected graph with 2-connected blocks H1, H2, . . . , Hr. Motivated by the exponential distance matrix, Bapat and Sivasubramanian in [4] defined its product distance matrix DG and showed that det DG only depends on det DHi for 1 ≤ i ≤ r and not on the manner in which its blocks are connected. In this work, when distances are symmetric, we generalize this result to the Smith Normal Form of DG and give an explicit formula for the invariant factors of DG.

Currently displaying 41 – 60 of 80