Improved bounds in Weaver and Feichtinger conjectures (Q1741455)

\textit{A. W. Marcus} et al. [Ann. Math. (2) 182, No. 1, 327--350 (2015; Zbl 1332.46056)] solved the Kadison-Singer problem by proving \textit{N. Weaver}'s \(\text{KS}_2\) conjecture [Discrete Math. 278, No. 1--3, 227--239 (2004; Zbl 1040.46040)]. The Kadison-Singer problem was known to be equivalent to a large number of problems in analysis such as \textit{J. Anderson}'s paving conjecture [Trans. Am. Math. Soc. 249, 303--329 (1979; Zbl 0408.46049)], the Feichtinger conjecture [\textit{P. G. Casazza} et al., Proc. Am. Math. Soc. 133, No. 4, 1025--1033 (2005; Zbl 1082.46018)] and the aforementioned Weaves \(\text{KS}_r\) conjectures. For more details about the Kadison-Singer problem, see [\textit{P. G. Casazza} et al., Contemp. Math. 414, 299--355 (2006; Zbl 1110.46038)]. \par The resolution of the Kadison-Singer problem raises the question of finding optimal quantative bounds in these equivalent problems. In the first part, the authors sharpen the constant in Weaver's \(\text{KS}_2\) conjecture that was given by Marcus et al. [loc. cit.] and show the following: For every \(\eta >4\), there exists \(\vartheta >0\) such that the following holds. Let \(u_1,\dots, u_m \in \mathbb C ^d\) be such that \(\|u_i\| \leq 1\) for all \(i\) and \[\sum_{i=1}^m |\langle u,u_i \rangle |^2 = \eta \quad \text{for all } \|u\| =1. \] Then there exists a partition of \(\{1,\dots, m\}\) into sets \(I_1\) and \(I_2\) so that, for \(k=1,2\), \[\sum_{i\in I_k} |\langle u,u_i \rangle |^2 \leq \eta - \vartheta \quad \text{for all } \|u\| =1. \] This improves the original work that yields the same result albeit for constants \(\eta > (2 + \sqrt 2)^2\). \par In the second part, the authors prove optimal asymptotic bounds on the size of the partitions in the Feichtinger conjecture.