Simple permutations: Decidability and unavoidable substructures

18Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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 permutations: every sufficiently long simple permutation contains an alternation or oscillation of length k. © 2007 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Brignall, R., Ruškuc, N., & Vatter, V. (2008). Simple permutations: Decidability and unavoidable substructures. Theoretical Computer Science, 391(1–2), 150–163. https://doi.org/10.1016/j.tcs.2007.10.037

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free