Sign-Balanced Pattern-Avoiding Permutation Classes

Abstract: A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let

S_{n} (s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r})

be the set of permutations in the symmetric group

S_{n}

which avoids patterns

s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r}

. The aim of this paper is to investigate when, for certain patterns

s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r}

,

S_{n} (s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r})

is sign-balanced for every integer

n > 1

. We prove that for any

s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r} s u b s e t e q S_{3}

, if

s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r}

is sign-balanced except

132, 213, 231, 312

, then

S_{n} (s i g m a_{1}, s i g m a_{2}, l d o t s, s i g m a_{r})

is sign-balanced for every integer

n > 1

. In addition, we give some results in the case of avoiding some patterns of length

4

.

This page was built for publication: Sign-Balanced Pattern-Avoiding Permutation Classes