AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogue of Kreweras's determinant formula for counting restricted lattice paths. In the proof the determinant has direct combinatorial significance
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractA natural interpretation of “maj” and “inv” q-counting of multiset permutations in terms of ...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
AbstractA formula involving a difference of the products of four q-binomial coefficients is shown to...
We use the Lindstrom-Gessel-Viennot Theorem to count nonintersecting lattice paths in a carefully ch...
AbstractThe enumeration of lattice paths lying between two boundaries in two dimensional space has b...
We study various aspects of lattice path combinatorics. A new object, which has Dyck paths as its su...
We study various aspects of lattice path combinatorics. A new object, which has Dyck paths as its su...
Abstractn-dimensional lattice paths which do not touch the hyperplanes xi − xi+1=⇔-1,i = 1,2,…,n − 1...
Abstract. We count a large class of lattice paths by using factorizations of free monoids. Besides t...
Abstract. n-dimensional lattice paths which do not touch the hyperplanes xi−xi+1 = −1, i = 1, 2,...,...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractA natural interpretation of “maj” and “inv” q-counting of multiset permutations in terms of ...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
AbstractA formula involving a difference of the products of four q-binomial coefficients is shown to...
We use the Lindstrom-Gessel-Viennot Theorem to count nonintersecting lattice paths in a carefully ch...
AbstractThe enumeration of lattice paths lying between two boundaries in two dimensional space has b...
We study various aspects of lattice path combinatorics. A new object, which has Dyck paths as its su...
We study various aspects of lattice path combinatorics. A new object, which has Dyck paths as its su...
Abstractn-dimensional lattice paths which do not touch the hyperplanes xi − xi+1=⇔-1,i = 1,2,…,n − 1...
Abstract. We count a large class of lattice paths by using factorizations of free monoids. Besides t...
Abstract. n-dimensional lattice paths which do not touch the hyperplanes xi−xi+1 = −1, i = 1, 2,...,...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractA natural interpretation of “maj” and “inv” q-counting of multiset permutations in terms of ...
DOI
Add to ORKG