{"title":"完成正交上大部分对称短步行走的渐近分类","authors":"Alexander Kroitor, Stephen Melczer","doi":"10.1007/s00026-024-00739-6","DOIUrl":null,"url":null,"abstract":"<div><p>In recent years, the techniques of analytic combinatorics in several variables (ACSV) have been applied to determine asymptotics for several families of lattice path models restricted to the orthant <span>\\({\\mathbb {N}}^d\\)</span> and defined by step sets <span>\\({\\mathcal {S}}\\subset \\{-1,0,1\\}^d\\setminus \\{\\textbf{0}\\}\\)</span>. Using the theory of ACSV for smooth singular sets, Melczer and Mishna determined asymptotics for the number of walks in any model whose set of steps <span>\\({\\mathcal {S}}\\)</span> is ‘highly symmetric’ (symmetric over every axis). Building on this work, Melczer and Wilson determined asymptotics for all models where <span>\\({\\mathcal {S}}\\)</span> is ‘mostly symmetric’ (symmetric over all but one axis) <i>except</i> for models whose set of steps have a vector sum of zero but are not highly symmetric. In this paper, we complete the asymptotic classification of the mostly symmetric case by analyzing a family of saddle-point-like integrals whose amplitudes are singular near their saddle points.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 2","pages":"575 - 599"},"PeriodicalIF":0.7000,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Completing the Asymptotic Classification of Mostly Symmetric Short Step Walks in an Orthant\",\"authors\":\"Alexander Kroitor, Stephen Melczer\",\"doi\":\"10.1007/s00026-024-00739-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In recent years, the techniques of analytic combinatorics in several variables (ACSV) have been applied to determine asymptotics for several families of lattice path models restricted to the orthant <span>\\\\({\\\\mathbb {N}}^d\\\\)</span> and defined by step sets <span>\\\\({\\\\mathcal {S}}\\\\subset \\\\{-1,0,1\\\\}^d\\\\setminus \\\\{\\\\textbf{0}\\\\}\\\\)</span>. Using the theory of ACSV for smooth singular sets, Melczer and Mishna determined asymptotics for the number of walks in any model whose set of steps <span>\\\\({\\\\mathcal {S}}\\\\)</span> is ‘highly symmetric’ (symmetric over every axis). Building on this work, Melczer and Wilson determined asymptotics for all models where <span>\\\\({\\\\mathcal {S}}\\\\)</span> is ‘mostly symmetric’ (symmetric over all but one axis) <i>except</i> for models whose set of steps have a vector sum of zero but are not highly symmetric. In this paper, we complete the asymptotic classification of the mostly symmetric case by analyzing a family of saddle-point-like integrals whose amplitudes are singular near their saddle points.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":\"29 2\",\"pages\":\"575 - 599\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-12-20\",\"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-024-00739-6\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-024-00739-6","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Completing the Asymptotic Classification of Mostly Symmetric Short Step Walks in an Orthant
In recent years, the techniques of analytic combinatorics in several variables (ACSV) have been applied to determine asymptotics for several families of lattice path models restricted to the orthant \({\mathbb {N}}^d\) and defined by step sets \({\mathcal {S}}\subset \{-1,0,1\}^d\setminus \{\textbf{0}\}\). Using the theory of ACSV for smooth singular sets, Melczer and Mishna determined asymptotics for the number of walks in any model whose set of steps \({\mathcal {S}}\) is ‘highly symmetric’ (symmetric over every axis). Building on this work, Melczer and Wilson determined asymptotics for all models where \({\mathcal {S}}\) is ‘mostly symmetric’ (symmetric over all but one axis) except for models whose set of steps have a vector sum of zero but are not highly symmetric. In this paper, we complete the asymptotic classification of the mostly symmetric case by analyzing a family of saddle-point-like integrals whose amplitudes are singular near their saddle points.
期刊介绍:
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