AbstractLet ai,j(n) denote the number of walks in n steps from (0,0) to (i,j), with steps (±1,0) and (0,±1), never touching a point (−k,0) with k⩾0 after the starting point. Bousquet-Mélou and Schaeffer conjectured a closed form for the number a−i,i(2n) when i⩾1. In this paper, we prove their conjecture, and give a formula for a−i,i(2n) for i⩽−1
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. T...
AbstractWe count lattice paths that are confined to the first quadrant by the nature of their step v...
© 2020 Ruijie XuLattice walk problems in the quarter-plane have been widely studied in recent years....
Article dans revue scientifique avec comité de lecture.In the first part of this paper, we enumerate...
AbstractLet S be a finite subset of Z2. A walk on the slit plane with steps in S is a sequence (0,0)...
Abstract. We count a large class of lattice paths by using factorizations of free monoids. Besides t...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
Abstract. We present a computer-aided, yet fully rigorous, proof of Ira Gessel’s tantalizingly simpl...
In this talk, we consider the simple walk ($\textit{i.e.}$ walk with a set of steps {$\mathcal{S}=\{...
Colloque avec actes et comité de lecture. internationale.International audienceWe present a method, ...
International audienceThis article deals with the enumeration of directed lattice walks on the integ...
AbstractWe consider lattice walks in the plane starting at the origin, remaining in the first quadra...
International audienceWe address the enumeration of walks with weighted small steps avoiding a quadr...
We study a number of combinatorial and algebraic structures arising from walks on the two-dimensiona...
AbstractThe number of lattice paths of fixed length consisting of unit steps in the north, south, ea...
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. T...
AbstractWe count lattice paths that are confined to the first quadrant by the nature of their step v...
© 2020 Ruijie XuLattice walk problems in the quarter-plane have been widely studied in recent years....
Article dans revue scientifique avec comité de lecture.In the first part of this paper, we enumerate...
AbstractLet S be a finite subset of Z2. A walk on the slit plane with steps in S is a sequence (0,0)...
Abstract. We count a large class of lattice paths by using factorizations of free monoids. Besides t...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
Abstract. We present a computer-aided, yet fully rigorous, proof of Ira Gessel’s tantalizingly simpl...
In this talk, we consider the simple walk ($\textit{i.e.}$ walk with a set of steps {$\mathcal{S}=\{...
Colloque avec actes et comité de lecture. internationale.International audienceWe present a method, ...
International audienceThis article deals with the enumeration of directed lattice walks on the integ...
AbstractWe consider lattice walks in the plane starting at the origin, remaining in the first quadra...
International audienceWe address the enumeration of walks with weighted small steps avoiding a quadr...
We study a number of combinatorial and algebraic structures arising from walks on the two-dimensiona...
AbstractThe number of lattice paths of fixed length consisting of unit steps in the north, south, ea...
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. T...
AbstractWe count lattice paths that are confined to the first quadrant by the nature of their step v...
© 2020 Ruijie XuLattice walk problems in the quarter-plane have been widely studied in recent years....