A Permutation Regularity Lemma

Details A Permutation Regularity Lemma A Permutation Regularity Lemma

2004-05-14

arxiv.org/abs/math/0405266v2

Mathematics

Combinatorics

Minor corrections, to appear in Electronic Journal of Combinatorics

Scientific paper

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that permutations which scatter small intervals contain all possible patterns of a given size, a proof that every permutation avoiding a specified pattern has a nearly monotone linear-sized subset, and a ``thin deletion'' result. We also show how one can count sub-patterns of a permutation with an integral, and relate our results to permutation quasirandomness in a manner analogous to the graph-theoretic setting.

Affiliated with

Also associated with

No associations

Rating

A Permutation Regularity Lemma 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 A Permutation Regularity Lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Permutation Regularity Lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671652