Computational Approaches to Consecutive Pattern Avoidance in Permutations

Details Computational Approaches to Consecutive Pattern Avoidance in Permutations Computational Approaches to Consecutive Pattern Avoidance in Permutations

2011-02-12

arxiv.org/abs/1102.2480v1

Mathematics

Combinatorics

12 pages

Scientific paper

In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms have been implemented in the accompanying Maple package CAV, which can be downloaded from the author's website. As a byproduct of the first algorithm, we have a theorem giving a sufficient condition for when two pattern sets are strongly (consecutively) Wilf-Equivalent. For the implementation of the second algorithm, we define the cluster tail generating function and show that it always satisfies a certain functional equation. We also explain how the CAV package can be used to approximate asymptotic constants for single pattern avoidance.

Affiliated with

Also associated with

No associations

Rating

Computational Approaches to Consecutive Pattern Avoidance in 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 Computational Approaches to Consecutive Pattern Avoidance in Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Approaches to Consecutive Pattern Avoidance in Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84730