A boolean tableau is an array T = (T i j ) 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 me
✦ LIBER ✦
Tableaux and Dual Tableaux: Transformation of Proofs
✍ Scribed by Joanna Golińska-Pilarek; Ewa Orłowska
- Publisher
- Springer Netherlands
- Year
- 2007
- Tongue
- English
- Weight
- 295 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Jacobi–Trudi Identities for Boolean Tabl
✍
Kazuto Asai
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 336 KB
Direct proof of the determinant expressi
✍
Wenchang Chu
📂
Article
📅
1992
🏛
Institute of Applied Mathematics, Chinese Academy
🌐
English
⚖ 290 KB
Körner's criterion of relevance and anal
✍
Joachim Schröder
📂
Article
📅
1992
🏛
Springer Netherlands
🌐
English
⚖ 426 KB
Planar decompositions of tableaux and Sc
✍
A.M Hamel; I.P Goulden
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 971 KB
Components of the Springer fiber and dom
✍
Thomas Pietraho
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 278 KB
Consider a complex classical semisimple Lie group along with the set of its nilpotent coadjoint orbits. When the group is of type A, the set of orbital varieties contained in a given nilpotent orbit is described a set of standard Young tableaux. We parameterize both, the orbital varieties and the ir
Adjacency of Young tableaux and the Spri
✍
N. G. J. Pagnon; N. Ressayre
📂
Article
📅
2007
🏛
SP Birkhäuser Verlag Basel
🌐
English
⚖ 297 KB