Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions

IF 1 3区 数学 Q1 MATHEMATICS
Andreas Nessmann
{"title":"Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions","authors":"Andreas Nessmann","doi":"10.1016/j.ejc.2024.104015","DOIUrl":null,"url":null,"abstract":"<div><p>Enumeration of walks with small steps in the quadrant has been a topic of great interest in combinatorics over the last few years. In this article, it is shown how to compute exact asymptotics of the number of such walks with fixed start- and endpoints for orbit-summable models with finite group, up to arbitrary precision. The resulting representation greatly resembles one conjectured for walks starting from the origin in 2020 by Chapon, Fusy and Raschel, differing only in terms appearing due to the periodicity of the model. We will see that the dependency on start- and endpoint is given by discrete polyharmonic functions, which are solutions of <span><math><mrow><msup><mrow><mo>△</mo></mrow><mrow><mi>n</mi></mrow></msup><mi>v</mi><mo>=</mo><mn>0</mn></mrow></math></span> for a discretization <span><math><mo>△</mo></math></span> of a Laplace–Beltrami operator. They can be decomposed into a sum of products of lower order polyharmonic functions of either the start- or the endpoint only, which leads to a partial extension of a theorem by Denisov and Wachtel.</p></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0195669824001008/pdfft?md5=e67c218ef49f6659d9d12b5f0c3f5a77&pid=1-s2.0-S0195669824001008-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001008","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Enumeration of walks with small steps in the quadrant has been a topic of great interest in combinatorics over the last few years. In this article, it is shown how to compute exact asymptotics of the number of such walks with fixed start- and endpoints for orbit-summable models with finite group, up to arbitrary precision. The resulting representation greatly resembles one conjectured for walks starting from the origin in 2020 by Chapon, Fusy and Raschel, differing only in terms appearing due to the periodicity of the model. We will see that the dependency on start- and endpoint is given by discrete polyharmonic functions, which are solutions of nv=0 for a discretization of a Laplace–Beltrami operator. They can be decomposed into a sum of products of lower order polyharmonic functions of either the start- or the endpoint only, which leads to a partial extension of a theorem by Denisov and Wachtel.

轨道可和象限行走和离散多谐函数的完全渐近展开
在过去几年里,枚举象限内小步数的行走一直是组合学界非常感兴趣的课题。本文展示了如何计算具有有限群的轨道可和模型中具有固定起点和终点的小步数的精确渐近线,并可达到任意精度。所得到的表示与查朋、富西和拉舍尔在 2020 年对从原点出发的行走的猜想极为相似,区别仅在于模型的周期性所导致的项。我们将看到,起点和终点的相关性由离散多谐函数给出,这些函数是拉普拉斯-贝尔特拉米算子离散化△的△nv=0 的解。它们可以分解为起点或终点的低阶多谐函数的乘积之和,这导致了 Denisov 和 Wachtel 定理的部分扩展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
×
引用
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学术官方微信