Generalized (\(P\), \(\omega\))-partitions and generating functions for trees

DOI10.1016/S0097-3165(03)00091-8zbMath1025.05005OpenAlexW2075130787MaRDI QIDQ1399914

Isao Arima, Hiroyuki Tagawa

Publication date: 30 July 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00091-8

zbMATH Keywords

treegenerating functionedge labelinghook length posetsGaussian posets\((P,R)\)-partitionhook edge labeling

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)

Cites Work

• Enumeration of partitions with hooklengths
• Dynkin diagram classification of \(\lambda\)-minuscule Bruhat lattices and of \(d\)-complete posets
• Bruhat lattices, plane partition generating functions, and minuscule representations
• Ordered structures and partitions

This page was built for publication: Generalized (\(P\), \(\omega\))-partitions and generating functions for trees