|国家预印本平台
首页|Almost refinement, reaping, and ultrafilter numbers

Almost refinement, reaping, and ultrafilter numbers

Almost refinement, reaping, and ultrafilter numbers

来源:Arxiv_logoArxiv
英文摘要

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 $\aleph_1$.

Jörg Brendle、Michael Hrušák、Francesco Parente

数学

Jörg Brendle,Michael Hrušák,Francesco Parente.Almost refinement, reaping, and ultrafilter numbers[EB/OL].(2025-06-30)[2025-07-16].https://arxiv.org/abs/2410.18595.点此复制

评论