Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10476033" target="_blank" >RIV/00216208:11320/23:10476033 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.33" target="_blank" >https://doi.org/10.4230/LIPIcs.ISAAC.2023.33</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.ISAAC.2023.33" target="_blank" >10.4230/LIPIcs.ISAAC.2023.33</a>
Alternative languages
Result language
angličtina
Original language name
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA22-15272S" target="_blank" >GA22-15272S: Principles of combinatorial generation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Leibniz International Proceedings in Informatics, LIPIcs
ISBN
978-3-95977-289-1
ISSN
1868-8969
e-ISSN
—
Number of pages
19
Pages from-to
1-19
Publisher name
Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
Place of publication
Dagstuhl, Germany
Event location
Kyoto, Japonsko
Event date
Dec 3, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—