Research on enumeration problem of pattern-avoiding permutations  

作　　者：Tongyuan ZHAO Xiaoqing LI Feng ZHAO 

机构地区：[1]College of Science,China University of Petroleum(Beijing),Beijing 102249,China [2]School of Mathematical Sciences,Hebei Normal University,Shijiazhuang 050024,China

出　　处：《Frontiers of Mathematics in China》2024年第4期191-213,共23页中国高等学校学术文摘·数学（英文）

摘　　要：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 science.This 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 sequences.It also introduces relevant research results on avoiding vincular patterns and barred patterns in S_(n).

关 键 词：Pattern avoidance combinatorial enumeration combinatorial bijection 

分 类 号：O15[理学—数学]