Copy the page URI to the clipboard
Bevan, David; Levin, Derek; Nugent, Peter; Pantone, Jay; Pudwell, Lara; Riehl, Manda and Tlachac, ML
(2016).
URL: http://dmtcs.episciences.org/1541/pdf
Abstract
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 l in Q+, one of these being the celebrated Duchon’s club paths with l = 2/3. In the remaining case, we use the machinery of analytic combinatorics to determine the minimal polynomial of its generating function, and deduce its growth rate.
Viewing alternatives
Download history
Item Actions
Export
About
- Item ORO ID
- 46866
- Item Type
- Journal Item
- ISSN
- 1365-8050
- Keywords
- permutation patterns; linear extensions
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Copyright Holders
- © 2016 The Authors
- Depositing User
- David Bevan