Adjoining Almost Disjoint Permutations
Say that two functions \(f,g : {\mathbb N} \to {\mathbb N}\) are eventually different if \(f(n) \neq g(n)\) for all but finitely many \(n \in {\mathbb N}\). \(F \subset {\mathbb N}^{\mathbb N}\) is an eventually different family if its members are pairwise eventually different. In case we have \(F \subset \text{Sym} ({\mathbb N})\), \(F\) is called an almost disjoint permutation family. Here, \(\text{Sym} ({\mathbb N})\) denotes, as usual, the group of all permutations of the natural numbers. The author proves it is consistent with ZFC that there is an almost disjoint permutation family which is maximal (with respect to inclusion), yet contained in an eventually different family of strictly larger size. This result is established by adjoining eventually different permutations over a model for Martin's axiom MA.
- Adjoining cofinitary permutations
- Almost disjoint permutation groups
- Almost avoiding pairs of permutations
- Adjacent-cycle permutations of a multiset
- Adjoining cofinitary permutations. II
- Adjacent transformations in permutations
- Adjacent \(q\)-cycles in permutations
- The asymptotics of almost alternating permutations
- Permutations that separate close elements
- On almost perfect nonlinear permutations
This page was built for publication: Adjoining Almost Disjoint Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531083)
