Abstract

In this paper we prove that for any function f from the class Lr on [0, 1) one can find a function g from the same class (which differs from f on a set of arbitrarily small measure) whose greedy algorithm with respect to the Vilenkin system converges to f.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.