AbstractAboolean tableauis an arrayT=(Tij) of the elements of a finite boolean algebra with several rows and infinitely many columns, where the entries increase from left to right and downwards. We study the generating functions for various classes of boolean tableaux. Applying the Gessel–Viennot method to certain nonplanar digraphs, we have determinantal formulas for the generating functions, which are regarded as generalized Jacobi–Trudi identities. By this theorem, we can also deal withideal-tableaux of zigzags, and give some new totally positive matrices
Using special decompositions of the frame into zigzag paths, a simple algorithm is given for reducin...
AbstractWe give bijective proofs for Jacobi–Trudi-type and Giambelli-type identities for symplectic ...
AbstractWe discuss counting problems linked to finite versions of Cantorʼs diagonal of infinite tabl...
AbstractWe give bijective proofs for Jacobi–Trudi-type and Giambelli-type identities for symplectic ...
AbstractIn a previous paper the authors used an algorithm for a bijection from the set F of all func...
The Bruhat posets (arising from Weyl groups) which are lattices are classified. Seshadri's standard ...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
AbstractIn this paper we describe planar decompositions of skew shape tableaux into strips and use t...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
AbstractWe translate Goulden's combinatorial proof of the Jacobi-Trudi identity into the language of...
AbstractThe generating function of R. P. Stanley for reverse plane partitions on a tableau shape is ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
Using special decompositions of the frame into zigzag paths, a simple algorithm is given for reducin...
AbstractWe give bijective proofs for Jacobi–Trudi-type and Giambelli-type identities for symplectic ...
AbstractWe discuss counting problems linked to finite versions of Cantorʼs diagonal of infinite tabl...
AbstractWe give bijective proofs for Jacobi–Trudi-type and Giambelli-type identities for symplectic ...
AbstractIn a previous paper the authors used an algorithm for a bijection from the set F of all func...
The Bruhat posets (arising from Weyl groups) which are lattices are classified. Seshadri's standard ...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
AbstractIn this paper we describe planar decompositions of skew shape tableaux into strips and use t...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies s...
AbstractWe translate Goulden's combinatorial proof of the Jacobi-Trudi identity into the language of...
AbstractThe generating function of R. P. Stanley for reverse plane partitions on a tableau shape is ...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
Using special decompositions of the frame into zigzag paths, a simple algorithm is given for reducin...
AbstractWe give bijective proofs for Jacobi–Trudi-type and Giambelli-type identities for symplectic ...
AbstractWe discuss counting problems linked to finite versions of Cantorʼs diagonal of infinite tabl...