Simple permutations: decidability and unavoidable substructures

Details Simple permutations: decidability and unavoidable substructures Simple permutations: decidability and unavoidable substructures

2006-09-07

arxiv.org/abs/math/0609211v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Simple permutations: decidability and unavoidable substructures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple permutations: decidability and unavoidable substructures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple permutations: decidability and unavoidable substructures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318102