Add to ORKGAbstract. In this article we will introduce two types of lattice paths, Schröder paths and Unknown paths. We will examine different properties of each, and attempt to relate th
In queuing theory, it is usual to have some models with a "reset" of thequeue. In terms of lattice p...
Recent methods used in lattice path combinatorics and various related branches of enumerative combin...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
In 1993 Bonin, Shapiro, and Simion showed that the Schröder numbers count certain kinds of lattice ...
Many famous families of integers can be represented by the number of paths through a lattice given v...
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, fo...
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Sc...
Part 2: Regular PapersInternational audienceThe set of Schröder words (Schröder language) is endowed...
AbstractConsider the 3-dimensional lattice paths running from (0,0,0) to (n,n,n), constrained to the...
We present here a survey of most notable Delannoy's works. These works are related to lattice ...
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context...
AbstractExtending the ‘walks’ of van Lint and Wilson, we introduce a new kind of weighted lattice pa...
In queuing theory, it is usual to have some models with a "reset" of thequeue. In terms of lattice p...
Recent methods used in lattice path combinatorics and various related branches of enumerative combin...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
In 1993 Bonin, Shapiro, and Simion showed that the Schröder numbers count certain kinds of lattice ...
Many famous families of integers can be represented by the number of paths through a lattice given v...
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, fo...
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Sc...
Part 2: Regular PapersInternational audienceThe set of Schröder words (Schröder language) is endowed...
AbstractConsider the 3-dimensional lattice paths running from (0,0,0) to (n,n,n), constrained to the...
We present here a survey of most notable Delannoy's works. These works are related to lattice ...
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context...
AbstractExtending the ‘walks’ of van Lint and Wilson, we introduce a new kind of weighted lattice pa...
In queuing theory, it is usual to have some models with a "reset" of thequeue. In terms of lattice p...
Recent methods used in lattice path combinatorics and various related branches of enumerative combin...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...