We establish a surprising connection between Menger's classical covering property and Blass-Laflamme's modern combinatorial notion of groupwise density. This connection implies a short proof of the groupwise density bound on the additivity number for Menger's property.

It is consistent that each union of many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consistent that for each nonprincipal ultrafilter , the cofinality of the reduced ultrapower is greater than . The model is constructed by oracle chain condition forcing, to which we give a self-contained introduction.

We prove several theorems about the cardinal $\mathfrak{g}$ associated with groupwise density. With respect to a natural ordering of families of nond-ecreasing maps fromω toω, all families of size $< \mathfrak{g}$ are below all unbounded families. With respect to a natural ordering of filters onω, all filters generated by $< \mathfrak{g}$ sets are below all non-feeble filters. If $\mathfrak{u}< \mathfrak{g}$ then $\mathfrak{b}< \mathfrak{u}$ and $\mathfrak{g} = \mathfrak{d} = \mathfrak{c}$ . (The definitions of these cardinals are recalled in the introduction.) Finally, (...) some consequences deduced from $\mathfrak{u}< \mathfrak{g}$ by Laflamme are shown to be equivalent to $\mathfrak{u}< \mathfrak{g}$. (shrink)