Article contents
A New Upper Bound for 1324-Avoiding Permutations
Published online by Cambridge University Press: 09 July 2014
Abstract
We prove that the number of 1324-avoiding permutations of length n is less than $(7+4\sqrt{3})^n$. The novelty of our method is that we injectively encode such permutations by a pair of words of length n over a finite alphabet that avoid a given factor.
- Type
- Paper
- Information
- Combinatorics, Probability and Computing , Volume 23 , Issue 5: Honouring the Memory of Philippe Flajolet - Part 1 , September 2014 , pp. 717 - 724
- Copyright
- Copyright © Cambridge University Press 2014
References
- 6
- Cited by