Research on enumeration problem of pattern-avoiding permutations

作     者：Tongyuan ZHAO Xiaoqing LI Feng ZHAO 

作者机构：College of ScienceChina University of Petroleum(Beijing)Beijing 102249China School of Mathematical SciencesHebei Normal UniversityShijiazhuang 050024China 

出 版 物：《Frontiers of Mathematics in China》 (中国高等学校学术文摘·数学（英文）)

年 卷 期：2024年第19卷第4期

页      面：191-213页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Pattern avoidance combinatorial enumeration combinatorial bijection 

摘      要：The problem of relevant enumeration with pattern-avoiding permutations is a significant topic in enumerative combinatorics and has wide applications in physics,chemistry,and computer *** paper summarizes the relevant conclusions of the enumeration of pattern-avoiding permutations on the nelement symmetric group Sn,alternating permutations,Dumont permutations,Ballot permutations,and inversion *** also introduces relevant research results on avoiding vincular patterns and barred patterns in S_(n).