Crossmark

Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases

Crossref DOI link: https://doi.org/10.1007/s00041-023-09997-z

Published Online: 2023-03-01

Published Print: 2023-04

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Berasategui, Miguel https://orcid.org/0000-0002-8198-3031
Lassalle, Silvia https://orcid.org/0000-0002-8471-0282
License Information

Text and Data Mining valid from 2023-03-01

Version of Record valid from 2023-03-01
More Information

Article History

Received: 12 September 2020

Revised: 28 August 2021

Accepted: 29 August 2021

First Online: 1 March 2023