We firstly review the constant term method (CTM), illustrating its combinatorial connections and show how it can be used to solve a cer-tain class of lattice path problems. We show the connection between the CTM, the transfer matrix method (eigenvectors and eigenvalues), partial difference equations, the Bethe Ansatz and orthogonal polyno-mials. Secondly, we solve a lattice path problem first posed in 1971. The model stated in 1971 was only solved for a special case – we solve the full model.
This lecture focuses on the Constant Propagation Analysis. This is just one of many types of analyse...
International audienceFollowing the work of Cano and Díaz, we study continuous binomial coefficients...
Abstract. In this article we will introduce two types of lattice paths, Schröder paths and Unknown ...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or hav...
Abstract. Many problems concerning lattice paths, especially on the square lattice have been accurat...
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin p...
Osculating lattice paths are sets of directed lattice paths which are not allowed to cross or have c...
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Sc...
International audienceFollowing the work of Cano and Díaz, we consider a continuous analog of lattic...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
Abstract. We state and prove several theorems that demonstrate how the coordinate Bethe Ansatz for t...
AbstractMills et al. (J. Combin. Theory Ser. A 34 (1983) 340–359) defined the poset of descending pl...
We consider a variant of the Cauchy problem for a multidimensional difference equation with constant...
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, fo...
This lecture focuses on the Constant Propagation Analysis. This is just one of many types of analyse...
International audienceFollowing the work of Cano and Díaz, we study continuous binomial coefficients...
Abstract. In this article we will introduce two types of lattice paths, Schröder paths and Unknown ...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or hav...
Abstract. Many problems concerning lattice paths, especially on the square lattice have been accurat...
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin p...
Osculating lattice paths are sets of directed lattice paths which are not allowed to cross or have c...
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Sc...
International audienceFollowing the work of Cano and Díaz, we consider a continuous analog of lattic...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
Abstract. We state and prove several theorems that demonstrate how the coordinate Bethe Ansatz for t...
AbstractMills et al. (J. Combin. Theory Ser. A 34 (1983) 340–359) defined the poset of descending pl...
We consider a variant of the Cauchy problem for a multidimensional difference equation with constant...
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, fo...
This lecture focuses on the Constant Propagation Analysis. This is just one of many types of analyse...
International audienceFollowing the work of Cano and Díaz, we study continuous binomial coefficients...
Abstract. In this article we will introduce two types of lattice paths, Schröder paths and Unknown ...