Atli Fannar Franklín, Anders Claesson, Christian Bean, Henning Úlfarsson, Jay Pantone
{"title":"通过反演枚举的受限排列组合","authors":"Atli Fannar Franklín, Anders Claesson, Christian Bean, Henning Úlfarsson, Jay Pantone","doi":"arxiv-2406.16403","DOIUrl":null,"url":null,"abstract":"Permutations are usually enumerated by size, but new results can be found by\nenumerating them by inversions instead, in which case one must restrict one's\nattention to indecomposable permutations. In the style of the seminal paper by\nSimion and Schmidt, we investigate all combinations of permutation patterns of\nlength at most 3.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"141 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Restricted Permutations Enumerated by Inversions\",\"authors\":\"Atli Fannar Franklín, Anders Claesson, Christian Bean, Henning Úlfarsson, Jay Pantone\",\"doi\":\"arxiv-2406.16403\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Permutations are usually enumerated by size, but new results can be found by\\nenumerating them by inversions instead, in which case one must restrict one's\\nattention to indecomposable permutations. In the style of the seminal paper by\\nSimion and Schmidt, we investigate all combinations of permutation patterns of\\nlength at most 3.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"141 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.16403\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.16403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Permutations are usually enumerated by size, but new results can be found by
enumerating them by inversions instead, in which case one must restrict one's
attention to indecomposable permutations. In the style of the seminal paper by
Simion and Schmidt, we investigate all combinations of permutation patterns of
length at most 3.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
