Counting paths in Young's lattice

DOI10.1016/0378-3758(93)90038-8zbMath0805.05088OpenAlexW1982347536MaRDI QIDQ1209644

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

zbMATH Keywords

pathssymmetric functionmultiplication operatorSchur functiondual operator

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Related Items

Schur operators and Knuth correspondences ⋮ Oscillating tableaux and nonintersecting lattice paths ⋮ Commutation and normal ordering for operators on symmetric functions ⋮ Enumeration of chains and saturated chains in Dyck lattices. ⋮ The lattice of integer partitions and its infinite extension ⋮ Flows with unit path capacities and related packing and covering problems ⋮ Effective scalar products of D-finite symmetric functions ⋮ Brauer diagrams, updown tableaux and nilpotent matrices ⋮ On bipartite graphs having minimum fourth adjacency coefficient

Cites Work

• Robinson-Schensted algorithms for skew tableaux
• Symmetric functions and P-recursiveness
• The Cauchy identity for \(Sp(2n)\)
• Schur operators and Knuth correspondences
• Permutations, matrices, and generalized Young tableaux
• Differential Posets
• S-function series
• An analogue to Robinson-Schensted correspondence for oscillating tableaux
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting paths in Young's lattice