Edges in the poset of partitions of an integer (Q1110511)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edges in the poset of partitions of an integer |
scientific article; zbMATH DE number 4072974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edges in the poset of partitions of an integer |
scientific article; zbMATH DE number 4072974 |
Statements
Edges in the poset of partitions of an integer (English)
0 references
1988
0 references
Let \(P_ n\) be the poset of partitions of n, ordered by refinement. The author counts the number NE(n,t) of edges in the Hasse diagram of \(P_ n\) between rank levels t and t-1. He presents the recursion formula \[ NE(n,t)=NE(n-1,t)+NE(t+1,2t-n+1). \]
0 references
poset
0 references
partitions
0 references
Hasse diagram
0 references
recursion formula
0 references
0.7125922441482544
0 references
0.7075079679489136
0 references
