{"title":"五类模式避免反转序列在一个屋檐下:生成树","authors":"T. Mansour","doi":"10.1080/10236198.2023.2253327","DOIUrl":null,"url":null,"abstract":"An inversion sequence of length n is a word which satisfies for each the inequalities . In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, , , 0123, or 0321.","PeriodicalId":15616,"journal":{"name":"Journal of Difference Equations and Applications","volume":"53 1","pages":"748 - 762"},"PeriodicalIF":1.1000,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Five classes of pattern avoiding inversion sequences under one roof: generating trees\",\"authors\":\"T. Mansour\",\"doi\":\"10.1080/10236198.2023.2253327\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An inversion sequence of length n is a word which satisfies for each the inequalities . In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, , , 0123, or 0321.\",\"PeriodicalId\":15616,\"journal\":{\"name\":\"Journal of Difference Equations and Applications\",\"volume\":\"53 1\",\"pages\":\"748 - 762\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Difference Equations and Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/10236198.2023.2253327\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Difference Equations and Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/10236198.2023.2253327","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Five classes of pattern avoiding inversion sequences under one roof: generating trees
An inversion sequence of length n is a word which satisfies for each the inequalities . In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, , , 0123, or 0321.
期刊介绍:
Journal of Difference Equations and Applications presents state-of-the-art papers on difference equations and discrete dynamical systems and the academic, pure and applied problems in which they arise. The Journal is composed of original research, expository and review articles, and papers that present novel concepts in application and techniques.
The scope of the Journal includes all areas in mathematics that contain significant theory or applications in difference equations or discrete dynamical systems.