0021-避免反转序列树的生成及Hong和Li的猜想

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters Pub Date : 2023-03-07 DOI:10.47443/dml.2023.012
T. Mansour
{"title":"0021-避免反转序列树的生成及Hong和Li的猜想","authors":"T. Mansour","doi":"10.47443/dml.2023.012","DOIUrl":null,"url":null,"abstract":"An inversion sequence of length n is a word e = e 0 · · · e n which satisfies, for each i ∈ [ n ] = { 0 , 1 , . . . , n } , the inequality 0 ≤ e i ≤ i . In this paper, by generating tree tools, an explicit formula is found for the generating function for the number of inversion sequences of length n that avoid 0021 , which resolves the conjecture of Hong and Li posed in the recent paper [ Electron. J. Combin. 29 (2022) #4.37].","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li\",\"authors\":\"T. Mansour\",\"doi\":\"10.47443/dml.2023.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An inversion sequence of length n is a word e = e 0 · · · e n which satisfies, for each i ∈ [ n ] = { 0 , 1 , . . . , n } , the inequality 0 ≤ e i ≤ i . In this paper, by generating tree tools, an explicit formula is found for the generating function for the number of inversion sequences of length n that avoid 0021 , which resolves the conjecture of Hong and Li posed in the recent paper [ Electron. J. Combin. 29 (2022) #4.37].\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 3

摘要

长度为n的反转序列是一个单词e = e0···en,它满足,对于每个i∈[n] ={0,1,…, n},不等式0≤e I≤I。本文通过生成树工具,找到了长度为n且避免0021的反转序列个数的生成函数的显式公式,解决了Hong和Li在最近的论文[Electron]中提出的猜想。[j].中华医学杂志,2014,29(2022)#4.37]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
An inversion sequence of length n is a word e = e 0 · · · e n which satisfies, for each i ∈ [ n ] = { 0 , 1 , . . . , n } , the inequality 0 ≤ e i ≤ i . In this paper, by generating tree tools, an explicit formula is found for the generating function for the number of inversion sequences of length n that avoid 0021 , which resolves the conjecture of Hong and Li posed in the recent paper [ Electron. J. Combin. 29 (2022) #4.37].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Mathematics Letters
Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.50
自引率
12.50%
发文量
47
审稿时长
12 weeks
期刊最新文献
On the permutation cycle structures for almost Moore digraphs of degrees 4 and 5 Atom-bond sum-connectivity index of line graphs General sum-connectivity index and general Randic index of trees with given maximum degree Extremal trees with fixed degree sequence for $\sigma$-irregularity The b$_q$-coloring of graphs
×
引用
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