Using partitions to characterize the minimum cardinality of an unbounded family in ^

DOI10.1016/0097-3165(90)90027-TMaRDI QIDQ749538zbMATH OpenFDO

Authors L. Brian Lawrence

Publication date 1990

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(90)90027-T

zbMATH Keywords

minimum cardinalitypartition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Review text

Let b be the minimum cardinality of an unbounded family in \(\omega_{\omega}\) partially ordered by \(\leq^*\), where \(f\leq^*g\) if f(n)\(\leq g(n)\) for all but a finite n. The author generalizes \(\leq^*\) to \(\nu_{\omega}\) for each infinite cardinal \(\nu\) and proves that \(b>\nu\) iff every sequence in \(\nu_{\omega}\) has a \(\leq^*\)-upper bound. It is also shown that the existence of an upper bound depends only on the partition of \(\nu\) induced by the point-inverse sets of the individual functions.

Recommendations

• Partitioning products of \({\mathcal P} (\omega)/\text{fin}\)
• Bounding and Dominating Number of Families of Functions on ω
• scientific article; zbMATH DE number 976086
• Negative partition relations for uncountable cardinals of cofinality
• Combinatorics for the dominating and unsplitting numbers

Cited in

(2)

• Partitioning products of \({\mathcal P} (\omega)/\text{fin}\)
• On general boundedness and dominating cardinals

This page was built for publication: Using partitions to characterize the minimum cardinality of an unbounded family in \(^{\omega}\omega\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749538)