{"title":"置换统计的连续分数","authors":"S. Elizalde","doi":"10.23638/DMTCS-19-2-11","DOIUrl":null,"url":null,"abstract":"We explore a bijection between permutations and colored Motzkin paths that\nhas been used in different forms by Foata and Zeilberger, Biane, and Corteel.\nBy giving a visual representation of this bijection in terms of so-called cycle\ndiagrams, we find simple translations of some statistics on permutations (and\nsubsets of permutations) into statistics on colored Motzkin paths, which are\namenable to the use of continued fractions. We obtain new enumeration formulas\nfor subsets of permutations with respect to fixed points, excedances, double\nexcedances, cycles, and inversions. In particular, we prove that cyclic\npermutations whose excedances are increasing are counted by the Bell numbers.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2017-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Continued fractions for permutation statistics\",\"authors\":\"S. Elizalde\",\"doi\":\"10.23638/DMTCS-19-2-11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We explore a bijection between permutations and colored Motzkin paths that\\nhas been used in different forms by Foata and Zeilberger, Biane, and Corteel.\\nBy giving a visual representation of this bijection in terms of so-called cycle\\ndiagrams, we find simple translations of some statistics on permutations (and\\nsubsets of permutations) into statistics on colored Motzkin paths, which are\\namenable to the use of continued fractions. We obtain new enumeration formulas\\nfor subsets of permutations with respect to fixed points, excedances, double\\nexcedances, cycles, and inversions. In particular, we prove that cyclic\\npermutations whose excedances are increasing are counted by the Bell numbers.\",\"PeriodicalId\":55175,\"journal\":{\"name\":\"Discrete Mathematics and Theoretical Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2017-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Theoretical Computer Science\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.23638/DMTCS-19-2-11\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.23638/DMTCS-19-2-11","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We explore a bijection between permutations and colored Motzkin paths that
has been used in different forms by Foata and Zeilberger, Biane, and Corteel.
By giving a visual representation of this bijection in terms of so-called cycle
diagrams, we find simple translations of some statistics on permutations (and
subsets of permutations) into statistics on colored Motzkin paths, which are
amenable to the use of continued fractions. We obtain new enumeration formulas
for subsets of permutations with respect to fixed points, excedances, double
excedances, cycles, and inversions. In particular, we prove that cyclic
permutations whose excedances are increasing are counted by the Bell numbers.
期刊介绍:
DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network.
Sections of DMTCS
Analysis of Algorithms
Automata, Logic and Semantics
Combinatorics
Discrete Algorithms
Distributed Computing and Networking
Graph Theory.