General Haar systems and greedy approximation
We show that each general Haar system is permutatively equivalent in , 1 < p < ∞, to a subsequence of the classical (i.e. dyadic) Haar system. As a consequence, each general Haar system is a greedy basis in , 1 < p < ∞. In addition, we give an example of a general Haar system whose tensor products are greedy bases in each , 1 < p < ∞, d ∈ ℕ. This is in contrast to [11], where it has been shown that the tensor products of the dyadic Haar system are not greedy bases in for 1...