避免{1243,2134}排列的个数

David Callan
{"title":"避免{1243,2134}排列的个数","authors":"David Callan","doi":"10.46298/dmtcs.5287","DOIUrl":null,"url":null,"abstract":"We show that the counting sequence for permutations avoiding both of the\n(classical) patterns 1243 and 2134 has the algebraic generating function\nsupplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia\nof Integer Sequences.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The number of {1243, 2134}-avoiding permutations\",\"authors\":\"David Callan\",\"doi\":\"10.46298/dmtcs.5287\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the counting sequence for permutations avoiding both of the\\n(classical) patterns 1243 and 2134 has the algebraic generating function\\nsupplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia\\nof Integer Sequences.\",\"PeriodicalId\":412397,\"journal\":{\"name\":\"Discrete Mathematics & Theoretical Computer Science\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics & Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/dmtcs.5287\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics & Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.5287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们证明了避免(经典)模式1243和2134的排列计数序列具有Vaclav Kotesovec对在线整数序列百科全书中的序列A164651提供的代数生成函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The number of {1243, 2134}-avoiding permutations
We show that the counting sequence for permutations avoiding both of the (classical) patterns 1243 and 2134 has the algebraic generating function supplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia of Integer Sequences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信