Norms of Schur Multipliers
| dc.creator | Davidson, Kenneth R. | |
| dc.creator | Donsig, Allan P. | |
| dc.date | 2005-06-03 | |
| dc.date.accessioned | 2026-07-07T05:20:31Z | |
| dc.date.available | 2026-07-07T05:20:31Z | |
| dc.description | A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in each row with another that has at most k entries in each column, for some finite k. If k is optimal, there is a Schur multiplier supported on the pattern with norm O(k^(1/2)), which is sharp up to a constant. The same techniques give a new, more elementary proof of results of Varopoulos and Pisier on Schur multipliers with given matrix entries of random sign. We consider the Schur multipliers for certain matrices which have a large symmetry group. In these examples, we are able to compute the Schur multiplier norm exactly. This is carried out in detail for a few examples including the Kneser graphs. | |
| dc.description | 23 pages | |
| dc.identifier | https://arxiv.org/abs/math/0506073 | |
| dc.identifier | http://arxiv.org/abs/math/0506073 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75403 | |
| dc.subject | Operator Algebras | |
| dc.subject | Primary 47L80; Secondary 15A60; 47A30 | |
| dc.title | Norms of Schur Multipliers | |
| dc.type | text |