Continued fractions for permutation statistics

S. Elizalde
{"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}
引用次数: 12

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
置换统计的连续分数
我们探索了Foata和Zeilberger、Biane和Corteel以不同形式使用的排列和有色Motzkin路径之间的双射。通过用所谓的循环图对这种双射进行可视化表示,我们发现了一些关于排列(和排列子集)的统计数据到有色Motzkin-路径的统计数据的简单翻译,其可用于连续馏分的使用。我们得到了关于不动点、超越、二重超越、循环和逆的置换子集的新的枚举公式。特别地,我们证明了超越量不断增加的循环项是由贝尔数计算的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
14.30%
发文量
39
期刊介绍: 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.
期刊最新文献
Bears with Hats and Independence Polynomials Pseudoperiodic Words and a Question of Shevelev Gossiping with interference in radio ring networks Dissecting power of intersection of two context-free languages Embedding phylogenetic trees in networks of low treewidth
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1