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
Abstract Recently the first author and Jang Soo Kim introduced lecture hall tableaux ...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
AbstractFor a fixed positive integer ℓ, let f(n,ℓ) denote the number of lattice paths that use the s...
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...
We present a determinantal formula for the steady state probability of each state of the TASEP (Tota...
We show that formulae of Gessel for the generating functions for Young standard tableaux of height b...
AbstractThe m × m determinant of hyperbolic Bessel functions det |Iai − bj(2x)| can be factored into...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...
22 pages, TeX, 16 figures; a new formula for a generating function addedThe problem of counting the ...
In this talk, the combinatorics of osculating lattice paths will be considered, and it will be shown...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
AbstractAboolean tableauis an arrayT=(Tij) of the elements of a finite boolean algebra with several ...
Abstract Recently the first author and Jang Soo Kim introduced lecture hall tableaux ...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
AbstractFor a fixed positive integer ℓ, let f(n,ℓ) denote the number of lattice paths that use the s...
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...
We present a determinantal formula for the steady state probability of each state of the TASEP (Tota...
We show that formulae of Gessel for the generating functions for Young standard tableaux of height b...
AbstractThe m × m determinant of hyperbolic Bessel functions det |Iai − bj(2x)| can be factored into...
Abstract. Tableau sequences of bounded height have been central to the analysis of k-noncrossing set...
22 pages, TeX, 16 figures; a new formula for a generating function addedThe problem of counting the ...
In this talk, the combinatorics of osculating lattice paths will be considered, and it will be shown...
. We prove a formula, conjectured by Conca and Herzog, for the number of all families of noninterse...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
AbstractAboolean tableauis an arrayT=(Tij) of the elements of a finite boolean algebra with several ...
Abstract Recently the first author and Jang Soo Kim introduced lecture hall tableaux ...
International audienceWe continue the enumeration of plane lattice walks with small steps avoiding t...
AbstractFor a fixed positive integer ℓ, let f(n,ℓ) denote the number of lattice paths that use the s...