Generating trees and forbidden subsequences

@article{West1996GeneratingTA,
  title={Generating trees and forbidden subsequences},
  author={Julian West},
  journal={Discrete Mathematics},
  year={1996},
  volume={157},
  pages={363-374}
}
We discuss an enumerative technique called generating frees which was introduced in the study of Baxter permutations. We apply the technique to some other classes of permutations with forbidden subsequences. We rederive some known results, e.g. ]S,(132,231)[ = 2” and l&,(123,132,213)1 = F,, and add several new ones: &(123,3241), S,(123,3214),8,(123,2143). Finally, we argue for the broader use of generating trees in combinatorial enumeration. 
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Pe~utatio~ with forbidden subsequences and nonseparable planar maps

  • S. Duhrcq, S. Gire, J. West
  • Discrete Math
  • 1996
1 Excerpt

Detest and S . Dulucq , Enumeration of directed column - convex animals with given perimeter and area , Dulucq ’ s PhD

  • S. Duhrcq
  • J . Combin . Theory Ser . A

Similar Papers

Loading similar papers…