Uniform convergence of the greedy algorithm with respect to the Walsh system
For any 0 < ϵ < 1, p ≥ 1 and each function one can find a function with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence is decreasing, where is the sequence of Fourier coefficients of g with respect to the Walsh system.