Repository of colleges and higher education institutions

Show document
A+ | A- | Help | SLO | ENG

Title:Combinatorial generation via permutation languages : Binary trees
Authors:ID Gregor, Petr (Author)
ID Mütze, Torsten (Author)
ID Namrata (Author)
Files:.pdf 1-s2.0-S0195669824001057-main.pdf (1,39 MB)
MD5: 0104332F3A7E489D7A5E78F8893F538F
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:FIŠ - Faculty of Information Studies in Novo mesto
Abstract: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.
Keywords:pattern avoidance, binary trees, mesh permutation patterns, combinatorial generation, algorithmic combinatorics
Publication status:Published
Publication version:Version of Record
Submitted for review:23.10.2023
Article acceptance date:12.06.2024
Publication date:18.07.2024
Year of publishing:2024
Number of pages:str. 1-41
Numbering:Vol. 122
PID:20.500.12556/ReVIS-11888 New window
COBISS.SI-ID:241055235 New window
UDC:519.17
ISSN on article:0195-6698
DOI:10.1016/j.ejc.2024.104020 New window
Publication date in ReVIS:02.07.2025
Views:19
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:European journal of combinatorics
Shortened title:Eur. j. comb.
Publisher:Academic Press, Academic Press, Elsevier
ISSN:0195-6698
COBISS.SI-ID:25427968 New window

Document is financed by a project

Funder:Czech Science Founda
Project number:GA 22-15272S

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:konstrukcijo algoritmov za generiranje, izogibanje vzorcem na binarnih drevesih, pretvorbo v permutacije


Back