AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, oscillating tableaux of bounded height d, and oscillating lattice walks in the d-dimensional Weyl chamber. Stanley asked what is the total number of such tableaux of length n and of any shape. We find a determinant formula for the exponential generating function. The same idea applies to prove Gessel's remarkable determinant formula for permutations with bounded length of increasing subsequences. We also give short algebraic derivations for some results of the reflection principle
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
AbstractThe m × m determinant of hyperbolic Bessel functions det |Iai − bj(2x)| can be factored into...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
Oscillating tableaux are certain walks in Young's lattice of partitions; they generalize standard Yo...
Gessel's famous Bessel determinant formula gives the generating function to enumerate permutations w...
AbstractCarlitz, Handa, and Mohanty proved determinantal formulas for counting partitions contained ...
AbstractWe consider permutations of 1,2,…,n2 whose longest monotone subsequence is of length n and a...
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractWe give two bijective proofs of a result of Corteel and Nadeau. We find a generating functio...
International audienceTableau sequences of bounded height have been central to the analysis of $k$-n...
AbstractLattice chains and Delannoy paths represent two different ways to progress through a lattice...
AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two cl...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
AbstractThe m × m determinant of hyperbolic Bessel functions det |Iai − bj(2x)| can be factored into...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
Oscillating tableaux are certain walks in Young's lattice of partitions; they generalize standard Yo...
Gessel's famous Bessel determinant formula gives the generating function to enumerate permutations w...
AbstractCarlitz, Handa, and Mohanty proved determinantal formulas for counting partitions contained ...
AbstractWe consider permutations of 1,2,…,n2 whose longest monotone subsequence is of length n and a...
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractWe give two bijective proofs of a result of Corteel and Nadeau. We find a generating functio...
International audienceTableau sequences of bounded height have been central to the analysis of $k$-n...
AbstractLattice chains and Delannoy paths represent two different ways to progress through a lattice...
AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two cl...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...