2000 character limit reached
Improved bounds in Weaver and Feichtinger Conjectures
Published 28 Aug 2015 in math.FA | (1508.07353v2)
Abstract: We sharpen the constant in the $KS_2$ conjecture of Weaver \cite{We}, which was validated by Marcus, Spielman, and Srivastava \cite{MSS} in their solution of the Kadison--Singer problem. We then apply this result to prove optimal asymptotic bounds on the size of partitions in the Feichtinger conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.