Template iterations and maximal cofinitary groups
Jörg Brendle (2003) used Hechler's forcing notion for adding a maximal almost disjoint family along an appropriate template forcing construction to show that $\mathfrak a$ (the minimal size of a maximal almost disjoint family) can be of countable cofinality. The main result of the present paper is that $\mathfrak a_g$, the minimal size of a maximal cofinitary group, can be of countable cofinality. To prove this we define a natural poset for adding a maximal cofinitary group of a given cardinality, which enjoys certain combinatorial properties allowing it to be used within a similar template forcing construction. Additionally we find that $\mathfrak a_p$, the minimal size of a maximal family of almost disjoint permutations, and $\mathfrak a_e$, the minimal size of a maximal eventually different family, can be of countable cofinality.