Corpus ID: 4947394

Pattern avoidance in forests of binary shrubs

  title={Pattern avoidance in forests of binary shrubs},
  author={D. Bevan and Derek Levin and P. Nugent and J. Pantone and Lara Pudwell and M. Riehl and M. L. Tlachac},
  journal={Discret. Math. Theor. Comput. Sci.},
  • D. Bevan, Derek Levin, +4 authors M. L. Tlachac
  • Published 2016
  • Mathematics, Computer Science
  • Discret. Math. Theor. Comput. Sci.
  • We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line y = lx , for some… CONTINUE READING

    Figures and Topics from this paper.

    Proofs of Conjectures about Pattern-Avoiding Linear Extensions
    • 1
    • PDF
    On Partially Ordered Patterns of Length 4 and 5 in Permutations
    • 1
    • PDF
    Rises in forests of binary shrubs


    Publications referenced by this paper.
    Analytic Combinatorics
    • 2,643
    • PDF
    Basic analytic combinatorics of directed lattice paths
    • 200
    • Highly Influential
    • PDF
    On the enumeration and generation of generalized Dyck words
    • 96
    Pattern avoidance in binary trees
    • 38
    • PDF
    Analytic combinatorics : functional equations, rational and algebraic functions
    • 62
    • PDF
    Non-Contiguous Pattern Avoidance in Binary Trees
    • 22
    • PDF
    Bijective Combinatorics
    • 47
    Pattern Avoidance in Ternary Trees
    • 14
    • PDF
    Pattern Avoidance in Extensions of Comb-Like Posets
    • 9
    • PDF