Abstract: The collection of branches (maximal linearly ordered sets of nodes) of the tree (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal -- for example, any level of the tree is almost disjoint from all of the branches. How many sets must be added to the family of branches to make it maximal? This question leads to a series of definitions and results: a set of nodes is {it off-branch} if it is almost disjoint from every branch in the tree; an {it off-branch family} is an almost disjoint family of off-branch sets; is a maximal off-branch family. Results concerning include: (in ZFC) , and (consistent with ZFC) is not equal to any of the standard small cardinal invariants , , , or . Most of these consistency results use standard forcing notions -- for example, comes from starting with a model of and adding -many Cohen reals. Many interesting open questions remain, though -- for example, .
Recommendations
Cites work
Cited in
(8)- scientific article; zbMATH DE number 1295211 (Why is no real title available?)
- Incomparable families and maximal trees
- Generic existence of MAD families
- Restricted mad families
- Forcing indestructibility of MAD families
- Soft almost disjoint families
- Almost disjoint families and diagonalizations of length continuum
- Invariance properties of almost disjoint families
This page was built for publication: A special class of almost disjoint families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858823)