paper

Combinatorial properties of MAD families

arXiv:2206.14936 · doi:10.4153/S0008414X25101879

Abstract

We study some strong combinatorial properties of families. An ideal is Shelah-Steprāns if for every set there is an element of that either intersects every set in or contains infinitely many members of it. We prove that a Borel ideal is Shelah-Steprāns if and only if it is Katětov above the ideal . We prove that Shelah-Steprāns families have strong indestructibility properties (in particular, they are both Cohen and random indestructible). We also consider some other strong combinatorial properties of families. Finally, it is proved that it is consistent to have and no Shelah-Steprāns families of size .

43 pages. Submitted. arXiv admin note: text overlap with arXiv:1810.09680