Beyond Kadison-Singer: paving and consequences
December 1 to December 5, 2014
American Institute of Mathematics,
Palo Alto, California
and Adam Marcus
This workshop will be devoted to broadening the
recent proof of the Kadison-Singer Problem
and to exploring its consequences. Many experts in the field agree that the
Kadison-Singer Problem has been resolved by the work
of Marcus, Spielman and Srivastava (MSS) through verifying Weaver's equivalent
$KS_2$ conjecture which was shown to
be equivalent to Anderson's paving conjecture. As a consequence, other
equivalent formulations in different fields of mathematics
are now also known to be true. A strong interaction between researchers in the
areas connected by this problem and by its proof
promises to enlarge our understanding and to address further open problems.
Particular topics envisioned for the workshop are the following:
- Find concrete implications of the positive solution to the Kadison Singer
problem in the various areas of research where it has equivalent formulations.
- Find the Anderson paving number for finite Parseval frames with Gram
matrices whose diagonal is bounded by 1/2. From the proof of Kadison-Singer it
is known that there is a universal number r of sets in the partition and it is
also known that r > 2, but MSS currently does not give any direct information on
- Verify the Feichtinger Conjecture directly. This requires generalizing the
MSS proof to infinite systems, including the partitioning of
each unit-norm Gabor frame into a universal number of Riesz basic sequences.
- Fine-tune the proof mechanism developed by MSS and make it as constructive
- Improve the required norm bound in the proof by MSS. If possible, show that
given $\epsilon > 0,$ the Gram matrix for any finite Parseval frame whose diagonal
is bounded by $1/2-\epsilon$ can be two-paved. It is known that two-paving with
$\epsilon = 0$ fails.
Currently, the proof of MSS requires the stronger condition that the norms are
bounded by $1-\sqrt 2/2-\epsilon.$
- Find an algorithm that constructs the partition which results from the MSS
proof or show that such a selection would not be achievable
with a polynomial time algorithm.
Material from the workshop
A list of participants.
The workshop schedule.
Papers arising from the workshop: