中文
相关论文

相关论文: Asymptotics of lattice walks via analytic combinat…

200 篇论文

We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…

组合数学 · 数学 2019-05-09 Stephen Melczer , Mark C. Wilson

Let S be a subset of {-1,0,1}^2 not containing (0,0). We address the enumeration of plane lattice walks with steps in S, that start from (0,0) and always remain in the first quadrant. A priori, there are 2^8 problems of this type, but some…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Mélou , Marni Mishna

The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of deep and powerful tools with applications across mathematics…

组合数学 · 数学 2017-09-18 Stephen Melczer

We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on $\mathbb{Z}^2$ defined by a fixed step set that is a subset of the non-zero vectors with coordinates 0, 1 or $-1$. We concern ourselves with…

组合数学 · 数学 2016-10-21 Alin Bostan , Frédéric Chyzak , Mark van Hoeij , Manuel Kauers , Lucien Pech

Around 2000, Ira Gessel conjectured that the number of lattice walks in the quadrant N^2, starting and ending at the origin (0,0) and taking their steps in {E,NE,W,SW} had a simple hypergeometric form. In the following decade, this problem…

组合数学 · 数学 2025-04-11 Mireille Bousquet-Mélou

Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…

组合数学 · 数学 2025-04-11 Alin Bostan , Mireille Bousquet-Mélou , Manuel Kauers , Stephen Melczer

We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…

组合数学 · 数学 2018-11-19 Manfred Buchacher , Manuel Kauers

We give precise asymptotics to the number of first time returning random walks in the standard orthogonal lattice in $\mathbb{R}$ and we prove that these numbers do not form a $P$-recursive sequence. In the process, the known asymptotics of…

组合数学 · 数学 2024-10-22 Dorin Dumitraşcu , Liviu Suciu

We present two classes of random walks restricted to the quarter plane whose generating function is not holonomic. The non-holonomy is established using the iterated kernel method, a recent variant of the kernel method. This adds evidence…

组合数学 · 数学 2011-02-10 Marni Mishna , Andrew Rechnitzer

In this work we consider two different aspects of weighted walks in cones. To begin we examine a particular weighted model, known as the Gouyou-Beauchamps model. Using the theory of analytic combinatorics in several variables we obtain the…

组合数学 · 数学 2018-05-22 Julien Courtiel , Stephen Melczer , Marni Mishna , Kilian Raschel

In the quarter plane, five lattice path models with unit steps have resisted the otherwise general approach of Fayolle, Rachel, and Kurkova. Here we consider these five models, called the singular models, and prove that the generating…

组合数学 · 数学 2019-02-20 Stephen Melczer , Marni Mishna

Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…

组合数学 · 数学 2018-04-18 Bryan Ek

In the past 20 years, the enumeration of plane lattice walks confined to a convex cone -- normalized into the first quadrant -- has received a lot of attention, stimulated the development of several original approaches, and led to a rich…

组合数学 · 数学 2025-04-11 Mireille Bousquet-Mélou

The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating…

组合数学 · 数学 2009-11-11 E. J. Janse van Rensburg , T. Prellberg , A. Rechnitzer

In two recent works \cite{BMM,BK}, it has been shown that the counting generating functions (CGF) for the 23 walks with small steps confined in a quadrant and associated with a finite group of birational transformations are holonomic, and…

概率论 · 数学 2011-01-13 Guy Fayolle , Kilian Raschel

Lattice paths in the quarter plane have led to a large and varied set of results in recent years. One major project has been the classification of step sets according to the properties of the corresponding generating functions, and this has…

组合数学 · 数学 2021-12-15 Nicholas R. Beaton , Aleksander L. Owczarek , Ruijie Xu

Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…

组合数学 · 数学 2009-09-29 Robin Pemantle , Mark C. Wilson

This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…

组合数学 · 数学 2014-10-08 Stephen Melczer , Marni Mishna

In the past fifteen years, the enumeration of lattice walks with steps takenin a prescribed set S and confined to a given cone, especially the firstquadrant of the plane, has been intensely studied. As a result, the generating functions…

组合数学 · 数学 2018-06-05 Alin Bostan , Mireille Bousquet-Mélou , Stephen Melczer

Lattice walks are used to model various physical phenomena. In particular, walks within Weyl chambers connect directly to representation theory via the Littelmann path model. We derive asymptotics for centrally weighted lattice walks within…

组合数学 · 数学 2024-05-24 Torin Greenwood , Samuel Simon
‹ 上一页 1 2 3 10 下一页 ›