正则序列求和函数分析的审美数与提升限制

C. Heuberger, Daniel Krenn
{"title":"正则序列求和函数分析的审美数与提升限制","authors":"C. Heuberger, Daniel Krenn","doi":"10.1137/1.9781611975505.3","DOIUrl":null,"url":null,"abstract":"When asymptotically analysing the summatory function of a $q$-regular sequence in the sense of Allouche and Shallit, the eigenvalues of the sum of matrices of the linear representation of the sequence determine the \"shape\" (in particular the growth) of the asymptotic formula. Existing general results for determining the precise behavior (including the Fourier coefficients of the appearing fluctuations) have previously been restricted by a technical condition on these eigenvalues. \nThe aim of this work is to lift these restrictions by providing a insightful proof based on generating functions for the main pseudo Tauberian theorem for all cases simultaneously. (This theorem is the key ingredient for overcoming convergence problems in Mellin--Perron summation in the asymptotic analysis.) \nOne example is discussed in more detail: A precise asymptotic formula for the amount of esthetic numbers in the first~$N$ natural numbers is presented. Prior to this only the asymptotic amount of these numbers with a given digit-length was known.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences\",\"authors\":\"C. Heuberger, Daniel Krenn\",\"doi\":\"10.1137/1.9781611975505.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When asymptotically analysing the summatory function of a $q$-regular sequence in the sense of Allouche and Shallit, the eigenvalues of the sum of matrices of the linear representation of the sequence determine the \\\"shape\\\" (in particular the growth) of the asymptotic formula. Existing general results for determining the precise behavior (including the Fourier coefficients of the appearing fluctuations) have previously been restricted by a technical condition on these eigenvalues. \\nThe aim of this work is to lift these restrictions by providing a insightful proof based on generating functions for the main pseudo Tauberian theorem for all cases simultaneously. (This theorem is the key ingredient for overcoming convergence problems in Mellin--Perron summation in the asymptotic analysis.) \\nOne example is discussed in more detail: A precise asymptotic formula for the amount of esthetic numbers in the first~$N$ natural numbers is presented. Prior to this only the asymptotic amount of these numbers with a given digit-length was known.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611975505.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611975505.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当在Allouche和Shallit意义上渐近分析$q$正则序列的求和函数时,序列线性表示的矩阵和的特征值决定了渐近公式的“形状”(特别是增长)。用于确定精确行为(包括出现波动的傅立叶系数)的现有一般结果先前受到这些特征值的技术条件的限制。这项工作的目的是通过同时为所有情况下的主要伪陶伯利定理生成函数提供一个有见地的证明来解除这些限制。(该定理是克服渐近分析中Mellin- Perron求和的收敛性问题的关键因素。)详细讨论了一个例子:给出了第1 ~$N$自然数中美观数数量的精确渐近公式。在此之前,只有这些数字的渐近数量与给定的数字长度是已知的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences
When asymptotically analysing the summatory function of a $q$-regular sequence in the sense of Allouche and Shallit, the eigenvalues of the sum of matrices of the linear representation of the sequence determine the "shape" (in particular the growth) of the asymptotic formula. Existing general results for determining the precise behavior (including the Fourier coefficients of the appearing fluctuations) have previously been restricted by a technical condition on these eigenvalues. The aim of this work is to lift these restrictions by providing a insightful proof based on generating functions for the main pseudo Tauberian theorem for all cases simultaneously. (This theorem is the key ingredient for overcoming convergence problems in Mellin--Perron summation in the asymptotic analysis.) One example is discussed in more detail: A precise asymptotic formula for the amount of esthetic numbers in the first~$N$ natural numbers is presented. Prior to this only the asymptotic amount of these numbers with a given digit-length was known.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Protection Number of Recursive Trees Ranked Schröder Trees QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract) Subcritical random hypergraphs, high-order components, and hypertrees Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences
×
引用
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