Stack-sorting and beyond

C Defant - 2022 - search.proquest.com
In 1990, West initiated an extensive investigation of the stack-sorting map, a deterministic
version of Knuth's stack-sorting machine that acts on permutations. At first sight, this map …

On partially ordered patterns of length 4 and 5 in permutations

ALL Gao, S Kitaev - arXiv preprint arXiv:1903.08946, 2019 - arxiv.org
Partially ordered patterns (POPs) generalize the notion of classical patterns studied widely
in the literature in the context of permutations, words, compositions and partitions. In an …

Pattern-Avoiding Binary Trees-Generation, Counting, and Bijections

P Gregor, T Mütze - 34th International Symposium on …, 2023 - drops.dagstuhl.de
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the
avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns …

[HTML][HTML] Combinatorial generation via permutation languages. VI. Binary trees

P Gregor, T Mütze - European Journal of Combinatorics, 2024 - Elsevier
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the
avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns …

Wilf equivalences for patterns in rooted labeled forests

M Ren - Advances in Applied Mathematics, 2024 - Elsevier
Building off recent work of Garg and Peng, we continue the investigation into classical and
consecutive pattern avoidance in rooted forests, resolving some of their conjectures and …

Proofs of Conjectures about Pattern-Avoiding Linear Extensions

C Defant - Discrete Mathematics & Theoretical Computer …, 2019 - dmtcs.episciences.org
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 …

[PDF][PDF] Pattern avoidance in task-precedence posets

M Paukner, L Pepin, M Riehl… - Discrete Mathematics & …, 2016 - dmtcs.episciences.org
We have extended classical pattern avoidance to a new structure: multiple task-precedence
posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices …

[PDF][PDF] Mustervermeidung in der Kombinatorik

G Reikl - 2019 - dmg.tuwien.ac.at
Das Ziel dieser Arbeit ist es, Mustervermeidung in verschiedensten kombinatorischen
Strukturen zu betreiben. Wir beginnen bei den Gitterpfaden, danach sind verschiedenste …

[PDF][PDF] Rises in forests of binary shrubs

J Remmel, S Zheng - Discrete Mathematics & Theoretical …, 2017 - dmtcs.episciences.org
The study of patterns in permutations associated with forests of binary shrubs was initiated
by D. Bevan et al.. In this paper, we study five different types of rise statistics that can be …

[引用][C] 1 Active Research Programs Combinatorial Exploration and Tilescope

J Pantone