The random paving property for uniformly bounded matrices

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages; v2 with cosmetic changes; v3 with corrections to Prop. 4; v4 with minor changes to text; v5 with correction to discu

Scientific paper

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 Bourgain and Tzafriri involves a long, delicate calculation. The new proof relies on the systematic use of symmetrization and (noncommutative) Khintchine inequalities to estimate the norms of some random matrices.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The random paving property for uniformly bounded matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The random paving property for uniformly bounded matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The random paving property for uniformly bounded matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-649742

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.