Table of Contents
ISRN Combinatorics
Volume 2014 (2014), Article ID 316535, 8 pages
http://dx.doi.org/10.1155/2014/316535
Research Article

Noncontiguous Pattern Containment in Binary Trees

1Department of Mathematics and Computer Science, Valparaiso University, Valparaiso, IN 46383, USA
2Department of Mathematics, Grand Valley State University, Allendale, MI 49401, USA
3Department of Mathematics, Troy University, Troy, AL 36082, USA
4Department of Mathematics, Harvey Mudd College, Claremont, CA 91711, USA

Received 28 January 2014; Accepted 5 March 2014; Published 24 March 2014

Academic Editors: A. Glen and A. P. Godbole

Copyright © 2014 Lara Pudwell et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J.-M. Steyaert and P. Flajolet, “Patterns and pattern-matching in trees: an analysis,” Information and Control, vol. 58, no. 1–3, pp. 19–58, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. P. Flajolet, P. Sipala, and J. M. Steyaert, “Analytic variations on the common subexpression problem,” in Automata, Languages and Programming, vol. 443 of Lecture Notes in Computer Science, pp. 220–234, Springer, Berlin, Germany, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, UK, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  4. V. Dotsenko, “Pattern avoidance in labelled trees,” Séminaire Lotharingien de Combinatoire, vol. 67, article B67b, 27 pages, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. A. Khoroshkin and D. Piontkovski, “On generating series of finitely presented operads,” http://arxiv.org/abs/1202.5170.
  6. E. S. Rowland, “Pattern avoidance in binary trees,” Journal of Combinatorial Theory. Series A, vol. 117, no. 6, pp. 741–758, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. N. Gabriel, K. Peske, L. Pudwell, and S. Tay, “Pattern avoidance in ternary trees,” Journal of Integer Sequences, vol. 15, no. 1, article 12.1.5, 20 pages, 2012. View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. Dairyko, S. Tyner, L. Pudwell, and C. Wynn, “Non-contiguous pattern avoidance in binary trees,” Electronic Journal of Combinatorics, vol. 19, no. 3, article P22, 21 pages, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. M. Bóna, “The absence of a pattern and the occurrences of another,” Discrete Mathematics & Theoretical Computer Science, vol. 12, no. 2, pp. 89–102, 2010. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. M. Bóna, “Surprising symmetries in objects counted by catalan numbers,” The Electronic Journal of Combinatorics, vol. 19, no. 1, article P62, 11 pages, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. N. Sloane, “The encyclopedia of integer sequences,” 2013, http://oeis.org/.
  12. T. Feil, K. Hutson, and R. M. Kretchmar, “Tree traversals and permutations,” Congressus Numerantium, vol. 172, pp. 201–221, 2005. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. M. Bousquet-Mélou, “Sorted and/or sortable permutations,” Discrete Mathematics, vol. 225, no. 1–3, pp. 25–50, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. S. Even, Graph Algorithms, Computer Science Press, Woodland Hills, Calif, USA, 1979. View at MathSciNet
  15. D. E. Knuth, The Art of Computer Programming: Sorting and Searching, vol. 3, Addison-Wesley, Reading, Mass, USA, 1973. View at MathSciNet
  16. D. Rotem, “Stack sortable permutations,” Discrete Mathematics, vol. 33, no. 2, pp. 185–196, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. D. Rotem and Y. Varol, “Generation of binary trees from ballot sequences,” Journal of the Association for Computing Machinery, vol. 25, no. 3, pp. 396–404, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. R. P. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, UK, 1999. View at MathSciNet
  19. P. Brändén and A. Claesson, “Mesh patterns and the expansion of permutation statistics as sums of permutation patterns,” Electronic Journal of Combinatorics, vol. 18, no. 2, article P5, 14 pages, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  20. H. Úlfarsson, “A unification of permutation patterns related to Schubert varieties,” Pure Mathematics and Applications, vol. 22, no. 2, pp. 273–296, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet