English

How to drive our families mad

Logic 2017-03-08 v3

Abstract

Given a family FF of pairwise almost disjoint sets on a countable set SS, we study maximal almost disjoint (mad) families F+F^+ extending FF. We define a+(F)a^+(F) to be the minimal possible cardinality of F+FF^+\setminus F for such F+F^+, and a+(κ)=sup{a+(F):Fκ}a^+(\kappa)=\sup\{a^+(F): |F| \leq \kappa \}. We show that all infinite cardinal less than or equal to the continuum continuum can be represented as a+(F)a^+(F) for some almost disjoint FF and that the inequalities 1=a<a+(1)=c\aleph_1=a<a^+(\aleph_1)=c and a=a+(1)<ca=a^+(\aleph_1)<c are both consistent. We also give a several constructions of mad families with some additional properties.

Keywords

Cite

@article{arxiv.math/0611744,
  title  = {How to drive our families mad},
  author = {Sakaé Fuchino and Stefan Geschke and Osvaldo Guzman and Lajos Soukup},
  journal= {arXiv preprint arXiv:math/0611744},
  year   = {2017}
}

Comments

revised and extended version, 19 pages