Yuliy Baryshnikov, Stephen Melczer, Robin Pemantle
{"title":"Asymptotics of Multivariate Sequences IV: Generating Functions with Poles on a Hyperplane Arrangement","authors":"Yuliy Baryshnikov, Stephen Melczer, Robin Pemantle","doi":"10.1007/s00026-023-00654-2","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span>\\(F(z_1,\\dots ,z_d)\\)</span> be the quotient of an analytic function with a product of linear functions. Working in the framework of analytic combinatorics in several variables, we compute asymptotic formulae for the Taylor coefficients of <i>F</i> using multivariate residues and saddle-point approximations. Because the singular set of <i>F</i> is the union of hyperplanes, we are able to make explicit the topological decompositions which arise in the multivariate singularity analysis. In addition to effective and explicit asymptotic results, we provide the first results on transitions between different asymptotic regimes, and provide the first software package to verify and compute asymptotics in non-smooth cases of analytic combinatorics in several variables. It is also our hope that this paper will serve as an entry to the more advanced corners of analytic combinatorics in several variables for combinatorialists.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 1","pages":"169 - 221"},"PeriodicalIF":0.6000,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00654-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Let \(F(z_1,\dots ,z_d)\) be the quotient of an analytic function with a product of linear functions. Working in the framework of analytic combinatorics in several variables, we compute asymptotic formulae for the Taylor coefficients of F using multivariate residues and saddle-point approximations. Because the singular set of F is the union of hyperplanes, we are able to make explicit the topological decompositions which arise in the multivariate singularity analysis. In addition to effective and explicit asymptotic results, we provide the first results on transitions between different asymptotic regimes, and provide the first software package to verify and compute asymptotics in non-smooth cases of analytic combinatorics in several variables. It is also our hope that this paper will serve as an entry to the more advanced corners of analytic combinatorics in several variables for combinatorialists.
让 \(F(z_1,\dots ,z_d)\)成为解析函数与线性函数乘积的商。在多变量解析组合学的框架下,我们利用多变量残差和鞍点逼近计算 F 的泰勒系数的渐近公式。由于 F 的奇异集是超平面的结合,因此我们能够明确拓扑分解,而拓扑分解出现在多元奇异性分析中。除了有效和明确的渐近结果之外,我们还首次提供了不同渐近状态之间的转换结果,并提供了第一个软件包,用于验证和计算多变量分析组合学非光滑情况下的渐近结果。我们也希望这篇论文能成为组合学家进入多变量解析组合学更高级领域的切入点。
期刊介绍:
Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board.
The scope of Annals of Combinatorics is covered by the following three tracks:
Algebraic Combinatorics:
Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices
Analytic and Algorithmic Combinatorics:
Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms
Graphs and Matroids:
Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches