Simple permutations: decidability and unavoidable substructures

Simple item page
dc.creatorBrignall, Robert
dc.creatorRuskuc, Nik
dc.creatorVatter, Vince
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:24:37Z
dc.date.available2026-07-07T07:24:37Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0609211
dc.identifierhttp://arxiv.org/abs/math/0609211
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116426
dc.subjectCombinatorics
dc.titleSimple permutations: decidability and unavoidable substructures
dc.typetext

Files

Collections

arXiv