关于Davenport-Schinzel序列的最大长度

Martin Klazar
{"title":"关于Davenport-Schinzel序列的最大长度","authors":"Martin Klazar","doi":"10.1090/dimacs/049/11","DOIUrl":null,"url":null,"abstract":"The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identical consecutive elements and no 5-term alternating subsequence. Improving the constant factor in the previous bounds of Hart and Sharir, and of Sharir and Agarwal, we prove that N5(n) < 2nα(n) +O(nα(n) ), where α(n) is the inverse to the Ackermann function. Quantities Ns(n) can be generalized and any finite sequence, not just an alternating one, can be assigned extremal function. We present a sequence with no 5-term alternating subsequence and with an extremal function n2.","PeriodicalId":144845,"journal":{"name":"Contemporary Trends in Discrete Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"On the maximum lengths of Davenport-Schinzel sequences\",\"authors\":\"Martin Klazar\",\"doi\":\"10.1090/dimacs/049/11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identical consecutive elements and no 5-term alternating subsequence. Improving the constant factor in the previous bounds of Hart and Sharir, and of Sharir and Agarwal, we prove that N5(n) < 2nα(n) +O(nα(n) ), where α(n) is the inverse to the Ackermann function. Quantities Ns(n) can be generalized and any finite sequence, not just an alternating one, can be assigned extremal function. We present a sequence with no 5-term alternating subsequence and with an extremal function n2.\",\"PeriodicalId\":144845,\"journal\":{\"name\":\"Contemporary Trends in Discrete Mathematics\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Contemporary Trends in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/049/11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contemporary Trends in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/049/11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

数量N5(n)是超过n个符号的有限序列的最大长度,该序列没有两个相同的连续元素,也没有5项交替子序列。改进了Hart和Sharir以及Sharir和Agarwal的上界中的常数因子,证明了N5(n) < 2nα(n) +O(nα(n)),其中α(n)是Ackermann函数的逆。量n (n)是广义的,任意有限数列(不只是交替数列)都可以被赋以极值函数。我们给出了一个无5项交替子序列且具有极值函数n2的序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the maximum lengths of Davenport-Schinzel sequences
The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identical consecutive elements and no 5-term alternating subsequence. Improving the constant factor in the previous bounds of Hart and Sharir, and of Sharir and Agarwal, we prove that N5(n) < 2nα(n) +O(nα(n) ), where α(n) is the inverse to the Ackermann function. Quantities Ns(n) can be generalized and any finite sequence, not just an alternating one, can be assigned extremal function. We present a sequence with no 5-term alternating subsequence and with an extremal function n2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信