Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of the plane are well suited to a functional equation approach for exact and asymptotic enumeration. This thesis surveys results on lattice paths under various restrictions, with an emphasis on lattice paths in the quarter plane. For these paths, we develop an original systematic combinatorial approach providing direct access to the exponential growth factors of the asymptotic expressions
In a companion article dedicated to the enumeration aspects, we showed how to obtain closed form for...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
This talk focusses on the interaction between the kernel method, a powerful collection of techniques...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
This paper develops a uni ed enumerative and asymptotic theory of directed 2-dimensional lattice p...
This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks o...
Recent methods used in lattice path combinatorics and various related branches of enumerative combin...
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of sev...
AMS Subject Classication: 05A, 33F10 Abstract. Many combinatorial quantities belong to the holonomic...
The kernel method has proved to be an extremely versatile tool for exact and asymptotic enumeration....
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
Benjamin HacklZusammenfassung in deutscher SpracheAlpen-Adria-Universität Klagenfurt, Masterarbeit, ...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
We study various aspects of lattice path combinatorics. A new object, which has Dyck paths as its su...
In a companion article dedicated to the enumeration aspects, we showed how to obtain closed form for...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
This talk focusses on the interaction between the kernel method, a powerful collection of techniques...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
This paper develops a uni ed enumerative and asymptotic theory of directed 2-dimensional lattice p...
This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks o...
Recent methods used in lattice path combinatorics and various related branches of enumerative combin...
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of sev...
AMS Subject Classication: 05A, 33F10 Abstract. Many combinatorial quantities belong to the holonomic...
The kernel method has proved to be an extremely versatile tool for exact and asymptotic enumeration....
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
Benjamin HacklZusammenfassung in deutscher SpracheAlpen-Adria-Universität Klagenfurt, Masterarbeit, ...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
We study various aspects of lattice path combinatorics. A new object, which has Dyck paths as its su...
In a companion article dedicated to the enumeration aspects, we showed how to obtain closed form for...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
This talk focusses on the interaction between the kernel method, a powerful collection of techniques...