Combinatorial Gray codes for classes of pattern avoiding permutations

Details Combinatorial Gray codes for classes of pattern avoiding permutations Combinatorial Gray codes for classes of pattern avoiding permutations

2007-04-16

arxiv.org/abs/0704.2048v2

Mathematics

Combinatorics

18 pages

Scientific paper

The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Gray codes for classes of pattern avoiding permutations 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 Combinatorial Gray codes for classes of pattern avoiding permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Gray codes for classes of pattern avoiding permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-44761