Mathematics – Combinatorics
Scientific paper
2005-02-23
Advances in Applied Mathematics 36(2) Special Issue on Pattern Avoiding Permutations (2006) pages 96-105
Mathematics
Combinatorics
Submitted to Advances in Applied Mathematics
Scientific paper
We construct a sequence of finite automata that accept subclasses of the class of 4231-avoiding permutations. We thereby show that the Wilf-Stanley limit for the class of 4231-avoiding permutations is bounded below by 9.35. This bound shows that this class has the largest such limit among all classes of permutations avoiding a single permutation of length 4 and refutes the conjecture that the Wilf-Stanley limit of a class of permutations avoiding a single permutation of length k cannot exceed (k-1)^2.
Albert Michael H.
Elder Murray
Rechnitzer Andrew
Westcott P.
Zabrocki Mike
No associations
LandOfFree
On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia 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 On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-235539