Counting paths in Young's lattice
From MaRDI portal
Publication:1209644
DOI10.1016/0378-3758(93)90038-8zbMATH Open0805.05088OpenAlexW1982347536MaRDI QIDQ1209644FDOQ1209644
Authors: Ira M. Gessel 
Publication date: 16 May 1993
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(93)90038-8
Recommendations
Cites Work
- Permutations, matrices, and generalized Young tableaux
- Title not available (Why is that?)
- Symmetric functions and P-recursiveness
- Schur operators and Knuth correspondences
- Title not available (Why is that?)
- Differential Posets
- Robinson-Schensted algorithms for skew tableaux
- The Cauchy identity for \(Sp(2n)\)
- An analogue to Robinson-Schensted correspondence for oscillating tableaux
- Title not available (Why is that?)
- S-function series
Cited In (13)
- Effective scalar products of D-finite symmetric functions
- On bipartite graphs having minimum fourth adjacency coefficient
- The lattice of integer partitions and its infinite extension
- Oscillating tableaux and nonintersecting lattice paths
- Functions on Young's lattice
- Title not available (Why is that?)
- Large Schröder paths by types and symmetric functions
- Enumeration of chains and saturated chains in Dyck lattices.
- Flows with unit path capacities and related packing and covering problems
- Schur operators and Knuth correspondences
- Commutation and normal ordering for operators on symmetric functions
- Skew Schur function representation of directed paths in a slit
- Brauer diagrams, updown tableaux and nilpotent matrices
This page was built for publication: Counting paths in Young's lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209644)
