We show that g ≤ c(Sym(ω)) where g is the groupwise density number and c(Sym(ω)) is the cofinality of the infinite symmetric group. This solves (the second half of) a problem addressed by Thomas.

We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: the least cardinal number of maximal cofinitary permutation groups; the least cardinal number of maximal almost disjoint permutation families; the cofinality of the permutation group on the set of natural numbers.We show that it is consistent with that ; in fact we show that in the Miller model.

We study the relationship between the cofinality $c(Sym(\omega))$ of the infinite symmetric group and the cardinal invariants $\frak{u}$ and $\frak{g}$ . In particular, we prove the following two results. Theorem 0.1 It is consistent with ZFC that there exists a simple $P_{\omega_{1}}$ -point and that $c(Sym(\omega)) = \omega_{2} = 2^{\omega}$ . Theorem 0.2 If there exist both a simple $P_{\omega_{1}}$ -point and a $P_{\omega_{2}}$ -point, then $c(Sym(\omega)) = \omega_{1}$.

Assuming CH, let be the saturated random graph of cardinality ω1. In this paper we prove that it is consistent that and can be any two prescribed regular cardinals subject only to the requirement.

The Mycielski ideal M k is defined to consist of all sets $A \subseteq ^{\mathbb{N}}k$ such that $\{f \upharpoonright X: f \in A\} \neq ^Xk$ for all X ∈ [N] ℵ 0 . It will be shown that the covering numbers for these ideals are all equal. However, the covering numbers of the closely associated Roslanowski ideals will be shown to be consistently different.

We show that under Martin's Axiom, the cofinality cf(Aut(Γ)) of the automorphism group of the random graph Γ is 2 ω.

In this paper, we study the relationship between the cofinalityc(Sym(ω)) of the infinite symmetric group and the minimal cardinality $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{b} $$ of an unbounded familyF of ω ω.