English

Almost refinement, reaping, and ultrafilter numbers

Logic 2026-01-28 v2

Abstract

We investigate the combinatorial structure of the set of maximal antichains in a Boolean algebra ordered by almost refinement. We also consider the reaping relation and its associated cardinal invariants, focusing in particular on reduced powers of Boolean algebras. As an application, we obtain that, on the one hand, the ultrafilter number of the Cohen algebra is greater than or equal to the cofinality of the meagre ideal and, on the other hand, a suitable parametrized diamond principle implies that the ultrafilter number of the Cohen algebra is equal to 1\aleph_1.

Keywords

Cite

@article{arxiv.2410.18595,
  title  = {Almost refinement, reaping, and ultrafilter numbers},
  author = {Jörg Brendle and Michael Hrušák and Francesco Parente},
  journal= {arXiv preprint arXiv:2410.18595},
  year   = {2026}
}

Comments

17 pages

R2 v1 2026-06-28T19:34:04.097Z