Picture of neon light reading 'Open'

Discover open research at Strathprints as part of International Open Access Week!

23-29 October 2017 is International Open Access Week. The Strathprints institutional repository is a digital archive of Open Access research outputs, all produced by University of Strathclyde researchers.

Explore recent world leading Open Access research content this Open Access Week from across Strathclyde's many research active faculties: Engineering, Science, Humanities, Arts & Social Sciences and Strathclyde Business School.

Explore all Strathclyde Open Access research outputs...

Strathprints

Pattern avoidance in forests of binary shrubs

Bevan, David and Levin, Derek and Nugent, Peter and Pantone, Jay and Pudwell, Lara and Riehl, Manda and Tlachac, ML (2016) Pattern avoidance in forests of binary shrubs. Discrete Mathematics and Theoretical Computer Science, 18 (2). ISSN 1365-8050

[img]
Preview
 Text (Bevan-etal-DMTCS2016-Pattern-avoidance-in-forests-of-binary-shrubs)
Bevan_etal_DMTCS2016_Pattern_avoidance_in_forests_of_binary_shrubs.pdf - Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (278kB) | Preview

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 = ℓx , for some ℓ ∈ Q + , one of these being the celebrated Duchon’s club paths with ℓ = 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.

Item type: Article
ID code: 58031
Keywords: pattern avoidance, permutation patterns, linear extensions, Mathematics, Discrete Mathematics and Combinatorics
Subjects: Science > Mathematics
Department: Faculty of Science > Computer and Information Sciences
Depositing user: Pure Administrator
Date deposited: 04 Oct 2016 10:13
Last modified: 16 Oct 2017 05:23
Related URLs:
URI: https://strathprints.strath.ac.uk/id/eprint/58031
Export data:
CORE (COnnecting REpositories)