The quantitative RϵR_\epsilon-conjecture for finite Riesz basic sequences

From papers

Let ϵ>0\epsilon>0 and A,B>0A,B>0. A unit norm Riesz basic sequence fii=1n{f_i}_{i=1}^n for 2n\ell_2^n has Riesz basis bounds 0<AB0<A\leq B when

A2iai2iaifi2B2iai2.A^2\sum_i|a_i|^2\leq\left\|\sum_i a_i f_i\right\|^2\leq B^2\sum_i|a_i|^2.

Quantitative RϵR_\epsilon-conjecture. There is a natural number r=r(ϵ,A,B)r=r(\epsilon,A,B) such that, for every nNn\in\mathbb N and every such sequence, there is a partition Ajj=1r{A_j}_{j=1}^r of 1,,n{1,\mathinner{\cdotp\cdotp\cdotp},n} for which each fiiAj{f_i}_{i\in A_j} is an ϵ\epsilon-Riesz basic sequence.

The paper introduces this finite-dimensional quantitative form because it is the version required to connect paving for triangular operators with the Riesz-sequence conjecture. The source does not state an independent resolution status for this quantitative formulation.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Peter G. Casazza and Janet C. Tremain, “The paving conjecture is equivalent to the paving conjecture for triangular matrices”, arXiv:math/0701101 (2007).

Solutions 0

No solutions have been posted yet.