Simple permutations: decidability and unavoidable substructures
  We 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. 
Robert Brignall, Nik Ruskuc, and Vince Vatter