activity
19922026
most citedExplicit constructions of RIP matrices and related problems

180 citations · 325 across the 53 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

math.FA2018★ 1 cited

Non-superreflexivity of Garling sequence spaces and applications to the existence of special types of conditional bases

Fernando Albiac, Jose L. Ansorena, Stephen J. Dilworth +1

In this paper we settle in the negative the problem of the superreflexivity of Garling sequence spaces by showing that they contain a complemented subspace isomorphic to a non supe…

math.FA2018

Lipschitz free spaces on finite metric spaces

Stephen J. Dilworth, Denka Kutzarova, Mikhail I. Ostrovskii

Main results of the paper: (1) For any finite metric space the Lipschitz free space on contains a large well-complemented subspace which is close to . (2) Lipschi…

math.FA2018★ 3 cited

Characterizations of almost greedy and partially greedy bases

S. J. Dilworth, Divya Khurana

We shall present new characterizations of partially greedy and almost greedy bases. A new class of basis (which we call reverse partially greedy basis) arises naturally from these…

math.FA2018

Building highly conditional almost greedy and quasi-greedy bases in Banach spaces

Fernando Albiac, Jose L. Ansorena, Stephen Dilworth +1

It is known that for a conditional quasi-greedy basis in a Banach space , the associated sequence of its conditional…

math.FA2018★ 1 cited

Weight-almost greedy bases

Stephen J. Dilworth, Denka Kutzarova, Vladimir Temlyakov +1

We introduce the notion of a \textit{weight-almost greedy} basis and show that a basis for a real Banach space is -almost greedy if and only if it is both quasi-greedy and -d…

math.FA2018★ 4 cited

The weighted Property (A) and the greedy algorithm

P. M. Berná, S. J. Dilworth, D. Kutzarova +2

We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bas…