# Pattern avoidance in forests of binary shrubs

@article{Bevan2016PatternAI, 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.}, year={2016}, volume={18} }

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

4 Citations

On Partially Ordered Patterns of Length 4 and 5 in Permutations

- Mathematics, Computer Science
- 2019

- 1
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 24 REFERENCES

Basic analytic combinatorics of directed lattice paths

- Computer Science, Mathematics
- 2002

- 200
- Highly Influential
- PDF

Polynomial equations with one catalytic variable, algebraic series and map enumeration

- Computer Science, Mathematics
- 2006

- 99
- PDF