20.500.12556/ReVIS-11888 Combinatorial generation via permutation languages Binary trees 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 studied by Dairyko, Pudwell, Tyner, and Wynn. Specifically, we propose algorithms for generating different classes of binary trees that are characterized by avoiding one or more of these generalized patterns. This is achieved by applying the recent Hartung–Hoang–Mütze– Williams generation framework, by encoding binary trees via permutations. In particular, we establish a one-to-one correspondence between tree patterns and certain mesh permutation patterns. We also conduct a systematic investigation of all tree patterns on at most 5 vertices, and we establish bijections between pattern-avoiding binary trees and other combinatorial objects, in particular pattern-avoiding lattice paths and set partitions. pattern avoidance binary trees mesh permutation patterns combinatorial generation algorithmic combinatorics konstrukcijo algoritmov za generiranje izogibanje vzorcem na binarnih drevesih pretvorbo v permutacije true true true Angleški jezik Slovenski jezik Neznano 2025-07-02 10:46:21 2025-07-02 10:46:21 2025-07-03 03:05:39 0000-00-00 00:00:00 2024 0 0 str. 1-41 Vol. 122 Dec. 2024 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2023-10-23 2024-06-12 2024-07-18 519.17 0195-6698 241055235 10.1016/j.ejc.2024.104020 1-s2.0-S0195669824001057-main.pdf 1-s2.0-S0195669824001057-main.pdf 1 0104332F3A7E489D7A5E78F8893F538F d0316b46d1625783bcd59944ed40b4abd3b4d309ae4c31fd34c31ec48842cfc0 70f6e915-5721-11f0-8080-001a4af901a5 https://revis.openscience.si/Dokument.php?lang=slv&id=13784 Fakulteta za informacijske študije v Novem mestu 0 0 0