2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/116426We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains an alternation or oscillation of length k.Combinatoricstext