7 citations · 24 across the 28 of their papers we have counts for
34 papers
Transfinite Schreier families and cardinal invariants
Kevin Beanland, Christian Rosendal
We study the dependence of the transfinite Schreier hierarchy on the choice of fundamental sequences for the countable limit ordinals. With each Schreier family we associate an int…
Lower-Order Refinements of Greedy Approximation
Kevin Beanland, Hung Viet Chu, Thomas Schlumprecht +1
For two countable ordinals and , a basis of a Banach space is said to be -quasi-greedy if it is 1) quasi-greedy, 2) -unconditional but not $\mathc…
On Schreier-type Sets, Partitions, and Compositions
Kevin Beanland, Hung Viet Chu
A nonempty set is -strong Schreier if . We define a set of positive integers to be sparse if either the set has at most t…
The depth of Tsirelson's norm
Kevin Beanland, Jędrzej Hodor
Tsirelson's norm on is defined as the supremum over a certain collection of iteratively defined, monotone increasing norms . For each positive…
Schreier families and -(almost) greedy bases
Kevin Beanland, Hung Viet Chu
Let be a hereditary collection of finite subsets of . In this paper, we introduce and characterize -(almost) greedy bases. Given such a famil…
Counting Unions of Schreier Sets
Kevin Beanland, Dmitriy Gorovoy, Jȩdrzej Hodor +1
A subset of positive integers is a Schreier set if it is non-empty and (here is the cardinality of ). For each positive integer , we define $k…