Sciweavers

Share
TCS
2008
8 years 6 months ago
Simple permutations: Decidability and unavoidable substructures
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
Robert Brignall, Nikola Ruskuc, Vincent Vatter
books