Displaying 2621 – 2640 of 3024

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 real symmetric matrices of odd order with a P-set of maximum size

Zhibin Du, Carlos Martins da Fonseca (2016)

Czechoslovak Mathematical Journal

Suppose that A is a real symmetric matrix of order n . Denote by m A ( 0 ) the nullity of A . For a nonempty subset α of { 1 , 2 , ... , n } , let A ( α ) be the principal submatrix of A obtained from A by deleting the rows and columns indexed by α . When m A ( α ) ( 0 ) = m A ( 0 ) + | α | , we call α a P-set of A . It is known that every P-set of A contains at most n / 2 elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As a first step...

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 Re-nonnegative definite solutions to the matrix equation A X B = C

Qing Wen Wang, Chang Lan Yang (1998)

Commentationes Mathematicae Universitatis Carolinae

An n × n complex matrix A is called Re-nonnegative definite (Re-nnd) if the real part of x * A x is nonnegative for every complex n -vector x . In this paper criteria for a partitioned matrix to be Re-nnd are given. A necessary and sufficient condition for the existence of and an expression for the Re-nnd solutions of the matrix equation A X B = C are presented.

Currently displaying 2621 – 2640 of 3024