We introduce the property “F-linked” of subsets of posets for a given free filter F on the natural numbers, and define the properties “μ-F-linked” and “θ-F-Knaster” for posets in a natural way. We show that θ-F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. Concerning iterations of such posets, we develop a general technique to construct θ-Fr-Knaster posets (where Fr is the Frechet ideal) via matrix iterations of <θ-ultrafilter-linked posets (restricted to some level of the (...) matrix). This is applied to prove consistency results about Cichoń's diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal invariants associated with it are pairwise different. At the end, we show that three strongly compact cardinals are enough to force that Cichoń's diagram can be separated into 10 different values. (shrink)

For ${b \in {^{\omega}}{\omega}}$ , let ${\mathfrak{c}^{\exists}_{b, 1}}$ be the minimal number of functions (or slaloms with width 1) to catch every functions below b in infinitely many positions. In this paper, by using the technique of forcing, we construct a generic model in which there are many coefficients ${\mathfrak{c}^{\exists}_{{b_\alpha}, 1}}$ with pairwise different values. In particular, under the assumption that a weakly inaccessible cardinal exists, we can construct a generic model in which there are continuum many coefficients ${\mathfrak{c}^{\exists}_{{b_\alpha}, 1}}$ (...) with pairwise different values. In conjunction with these results, we give a generic model in which there are many Yorioka’s ideals ${\mathcal{I}_{f_\alpha}}$ with pairwise different covering numbers. (shrink)