Simple permutations: decidability and unavoidable substructures
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0609211,
title = {Simple permutations: decidability and unavoidable substructures},
author = {Robert Brignall and Nik Ruskuc and Vince Vatter},
journal= {arXiv preprint arXiv:math/0609211},
year = {2007}
}