© 2020 Ruijie XuLattice walk problems in the quarter-plane have been widely studied in recent years. The main objective is to calculate the number of configurations, that is the number of $n$-step walks ending at certain points or alternatively, the generating function of the walks. In combinatorics, physics and probability theory, other properties such as asymptotic behavior and the algebra of the generating functions are also of interest. In this thesis we focus on solving quarter-plane lattice walks with interactions via the kernel method. We assign interaction $a$ to the $x$-axis, $b$ to the $y$-axis and $c$ to the origin. We denote $q_{n,k,l,h,u,v}$ as the number of $n$-step paths that start at $(0,0)$ and end at point $(k,l)$, and...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
AbstractLet S be a finite subset of Z2. A walk on the slit plane with steps in S is a sequence (0,0)...
International audienceEnumeration of planar lattice walks is a classical topic in combinatorics, at ...
The kernel method has proved to be an extremely versatile tool for exact and asymptotic enumeration....
In this survey we present an analytic approach to solve problems concerning (deterministic...
Planar lattice walks are combinatorial objects which arise in statistical mechanics in both the mode...
Classifying lattice walks in restricted lattices is an important problem in enumerative combinatoric...
AbstractThis work considers the nature of generating functions of random lattice walks restricted to...
AbstractWe present two classes of random walks restricted to the quarter plane with non-holonomic ge...
Abstract. In this survey we present an analytic approach to solve problems concerning (deterministic...
Article dans revue scientifique avec comité de lecture.In the first part of this paper, we enumerate...
Abstract. In this article we present a new approach for finding the generating function counting (no...
We present two classes of random walks restricted to the quarter plane whose gen-erating function is...
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of sev...
In this thesis, we investigate the enumeration of lattice walk models, with or without interactions,...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
AbstractLet S be a finite subset of Z2. A walk on the slit plane with steps in S is a sequence (0,0)...
International audienceEnumeration of planar lattice walks is a classical topic in combinatorics, at ...
The kernel method has proved to be an extremely versatile tool for exact and asymptotic enumeration....
In this survey we present an analytic approach to solve problems concerning (deterministic...
Planar lattice walks are combinatorial objects which arise in statistical mechanics in both the mode...
Classifying lattice walks in restricted lattices is an important problem in enumerative combinatoric...
AbstractThis work considers the nature of generating functions of random lattice walks restricted to...
AbstractWe present two classes of random walks restricted to the quarter plane with non-holonomic ge...
Abstract. In this survey we present an analytic approach to solve problems concerning (deterministic...
Article dans revue scientifique avec comité de lecture.In the first part of this paper, we enumerate...
Abstract. In this article we present a new approach for finding the generating function counting (no...
We present two classes of random walks restricted to the quarter plane whose gen-erating function is...
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of sev...
In this thesis, we investigate the enumeration of lattice walk models, with or without interactions,...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
AbstractLet S be a finite subset of Z2. A walk on the slit plane with steps in S is a sequence (0,0)...
International audienceEnumeration of planar lattice walks is a classical topic in combinatorics, at ...