Albiac Alesanco, Fernando JoséAnsorena, José L.Wojtaszczyk, Przemyslaw2019-08-262019-08-2620191432-094010.1007/s00365-017-9399-xhttps://academica-e.unavarra.es/handle/2454/34670This is a post-peer-review, pre-copyedit version of an article published in Constr Approx (2019) 49:103–122. The final authenticated version is available online at: https://doi.org/10.1007/s00365-017-9399-xFor a conditional quasi-greedy basis B in a Banach space, the associated conditionality constants km[B] verify the estimate km[B]=O(logm). Answering a question raised by Temlyakov, Yang, and Ye, several authors have studied whether this bound can be improved when we consider quasi-greedy bases in some special class of spaces. It is known that every quasi-greedy basis in a superreflexive Banach space verifies km[B]=O((logm)1-E) for some 0<E<1, and this is optimal. Our first goal in this paper will be to fill the gap between the general case and the superreflexive case and investigate the growth of the conditionality constants in nonsuperreflexive spaces. Roughly speaking, the moral will be that we can guarantee optimal bounds only for quasi-greedy bases in superreflexive spaces. We prove that if a Banach space X is not superreflexive, then there is a quasi-greedy basis B in a Banach space Y finitely representable in X with km[B]approximate to logm. As a consequence, we obtain that for every 2<q<, there is a Banach space X of type 2 and cotype q possessing a quasi-greedy basis B with km[B]approximate to logm. We also tackle the corresponding problem for Schauder bases and show that if a space is nonsuperreflexive, then it possesses a basic sequence B with km[B]approximate to m.21 p.application/pdfeng© Springer Science+Business Media, LLC 2017Thresholding greedy algorithmConditional basisConditionality constantsQuasi-greedy basisTypeCotypeReflexivitySuperreflexivitySuper propertyFinite representabilityBanach spacesinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess