Pattern avoidance in forests of binary shrubs

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 avoidin...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Mathematics and Theoretical Computer Science Vol. 18; no. 2; p. F1
Main Authors Bevan, David, Levin, Derek, Nugent, Peter, Pantone, Jay, Pudwell, Lara, Riehl, Manda, Tlachac, ML
Format Journal Article
LanguageEnglish
Published Nancy DMTCS 01.06.2016
Subjects
Online AccessGet full text

Cover

Loading…