Bijections in weakly increasing trees via binary trees

发布时间:2024-11-19浏览次数:10

题目:Bijections in weakly increasing trees via binary trees

报告人:Yang LiShandong University)


时间:2024.11.26 ,15:30-16:30 

地点:明德楼B201-1



摘要:

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we construct four bijections on weakly increasing trees in the same flavor via switching the role of left child and right child of some specified nodes in their corresponding binary trees. Consequently, bijective proofs of the aforementioned symmetries found by Dong et al. and a non-recursive construction of a bijection on plane trees of Deutsch are provided. Applications of some symmetries in weakly increasing trees to permutation patterns and statistics will also be discussed.




更多信息:研究生研讨班



Copyright (C)2023 哈尔滨工业大学数学研究院版权所有
人才招聘:
联系我们:
电话:86413107      邮箱:IASM@hit.edu.cn
地址:哈尔滨市南岗区西大直街92号
技术支持:哈尔滨工业大学网络安全和信息化办公室