Proofs of Conjectures about Pattern-Avoiding Linear Extensions
From MaRDI portal
Publication:5207852
zbMATH Open1432.05003arXiv1905.02309MaRDI QIDQ5207852
Author name not available (Why is that?)
Publication date: 13 January 2020
Abstract: After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear extensions give rise to permutations that avoid certain patterns. We build off of two of these papers. We first consider pattern avoidance in -ary heaps, where we obtain a general result that proves a conjecture of Levin, Pudwell, Riehl, and Sandberg in a special case. We then prove some conjectures that Anderson, Egge, Riehl, Ryan, Steinke, and Vaughan made about pattern-avoiding linear extensions of rectangular posets.
Full work available at URL: https://arxiv.org/abs/1905.02309
No records found.
No records found.
This page was built for publication: Proofs of Conjectures about Pattern-Avoiding Linear Extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207852)
