AbstractIn 1996, Garsia and Haiman introduced a bivariate analogue of the Catalan numbers that counts multiplicities of the sign character in a certain doubly graded Sn-module. Haglund conjectured a combinatorial interpretation for this sequence by defining two statistics on the set of lattice paths staying inside the triangle bounded by x=0, y=x, and y=n. This conjecture was eventually proved by Garsia and Haglund. Later, the present author introduced similar statistics for lattice paths staying inside other triangles, whose generating function is conjectured to give the higher q,t-Catalan sequences of Garsia and Haiman. This article generalizes these combinatorial statistics to lattice paths within certain trapezoidal regions. We introduc...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
AbstractA k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane int...
AbstractIn 1996, Garsia and Haiman introduced a bivariate analogue of the Catalan numbers that count...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractThis paper investigates determining the statistics satisfying the Narayana distribution on t...
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert serie...
This chapter contains an account of a two-parameter version of the Catalan numbers, and correspondin...
The Catalan numbers form one of the more frequently encountered counting sequences in combinatorics....
PhDThis thesis concerns the enumeration and structural properties of lattice paths. The study of D...
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck pat...
AbstractCatalan numbers C(n)=1/(n+1)2nn enumerate binary trees and Dyck paths. The distribution of p...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
AbstractThis paper investigates determining the statistics satisfying the Narayana distribution on t...
AbstractIn this paper we prove a strengthening of the classical Chung–Feller theorem and a weighted ...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
AbstractA k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane int...
AbstractIn 1996, Garsia and Haiman introduced a bivariate analogue of the Catalan numbers that count...
The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and ...
AbstractThis paper investigates determining the statistics satisfying the Narayana distribution on t...
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert serie...
This chapter contains an account of a two-parameter version of the Catalan numbers, and correspondin...
The Catalan numbers form one of the more frequently encountered counting sequences in combinatorics....
PhDThis thesis concerns the enumeration and structural properties of lattice paths. The study of D...
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck pat...
AbstractCatalan numbers C(n)=1/(n+1)2nn enumerate binary trees and Dyck paths. The distribution of p...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
AbstractThis paper investigates determining the statistics satisfying the Narayana distribution on t...
AbstractIn this paper we prove a strengthening of the classical Chung–Feller theorem and a weighted ...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg in...
AbstractA k-generalized Dyck path of length n is a lattice path from (0,0) to (n,0) in the plane int...