Papers
Topics
Authors
Recent
Search
2000 character limit reached

Combinatorial properties of MAD families

Published 29 Jun 2022 in math.LO and math.GN | (2206.14936v1)

Abstract: We study some strong combinatorial properties of $\textsf{MAD}$ families. An ideal $\mathcal{I}$ is Shelah-Stepr={a}ns if for every set $X\subseteq{\left[ \omega\right]}{<\omega}$ there is an element of $\mathcal{I}$ that either intersects every set in $X$ or contains infinitely many members of it. We prove that a Borel ideal is Shelah-Stepr={a}ns if and only if it is Kat\v{e}tov above the ideal $\textsf{fin}\times\textsf{fin}$. We prove that Shelah-Stepr={a}ns $\textsf{MAD}$ families have strong indestructibility properties (in particular, they are both Cohen and random indestructible). We also consider some other strong combinatorial properties of $\textsf{MAD}$ families. Finally, it is proved that it is consistent to have $\mathrm{non}(\mathcal{M}) = {\aleph}{1}$ and no Shelah-Stepr={a}ns families of size ${\aleph}{1}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.