Variations of Property (A) Constants and Lebesgue-type Inequalities for the Weak Thresholding Greedy Algorithms
Abstract
Albiac and Wojtaszczyk introduced property (A) to characterize 1-greedy bases. Later, Dilworth et al. generalized the concept to C-property (A), where the case C = 1 gives property (A). They (among other results) characterized greedy bases by unconditionality and C-property (A). In this paper, we extend the definition of the so-called A-property constant to (A,τ)-property constants and use the extension to obtain new estimates for various Lebesgue parameters. Furthermore, we study the relation among (A,τ)-property constants and other well-known constants when τ varies.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.