中文
相关论文

相关论文: Partially directed paths in a wedge

200 篇论文

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

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

We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…

组合数学 · 数学 2016-03-01 Stephen Melczer , Mark C. Wilson

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

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

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

Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are…

组合数学 · 数学 2022-01-26 Helmut Prodinger

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

We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…

组合数学 · 数学 2018-05-22 Samuel Johnson , Marni Mishna , Karen Yeats

The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…

组合数学 · 数学 2020-04-10 Helmut Prodinger

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

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Melou , Gilles Schaeffer

In the context of lattice walk enumeration in cones, we consider the number of walks in the quarter plane with fixed starting and ending points, prescribed step-set and given length. After renormalization, this number may be interpreted as…

组合数学 · 数学 2023-09-28 Andrew Elvey-Price , Andreas Nessmann , Kilian Raschel

In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…

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

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

Let S be a finite subset of Z^2. A walk on the slit plane with steps in S is a sequence (0,0)=w_0, w_1, ..., w_n of points of Z^2 such that w_{i+1}-w_i belongs to S for all i, and none of the points w_i, i>0, lie on the half-line H= {(k,0):…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Melou

This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…

Gessel walks are lattice paths confined to the quarter plane that start at the origin and consist of unit steps going either West, East, South-West or North-East. In 2001, Ira Gessel conjectured a nice closed-form expression for the number…

组合数学 · 数学 2016-12-30 Alin Bostan , Irina Kurkova , Kilian Raschel

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

概率论 · 数学 2023-02-14 E. Filichkina , E. Yarovaya

We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…

组合数学 · 数学 2021-12-15 Nicholas R. Beaton
‹ 上一页 1 2 3 10 下一页 ›