News & Events


Tuesday, December 11, 2018 - 03:30 to 04:30
Mathematics Seminar Room
Divya Khurana
Weizmann Institute, Israel
Greedy Approximations

Abstract: The 'Thresholding Greedy Algorithm' was introduced by Konyagin and Temlyakov in order to study some special bases in Banach spaces. This basis is known as greedy basis and is characterized by unconditional and democratic properties of the basis. Later, Albiac, Dilworth, Kalton, Wojtaszczyk and few other author's studied the weaker versions of greedy basis, namely, almost greedy basis and partially greedy basis. Almost greedy basis can be characterized by quasi-greediness and democratic property and partially greedy basis can be characterized by quasi-greediness and conservative property. In this talk we will discuss some new characterizations of almost greedy and partially greedy basis. We will also discuss generalizations of greedy basis and its relatives. First part of this talk is joint work with Stephen J. Dilworth.

Contact us

School of Mathematical Sciences

NISERPO- Bhimpur-PadanpurVia- Jatni, District- Khurda, Odisha, India, PIN- 752050

Tel: +91-674-249-4081

Corporate Site - This is a contributing Drupal Theme
Design by WeebPal.