LinearExtensionCount on BinaryTree
The number of linear extensions of the tree as a poset: n! over the tree factorial.
Called as CombinatorialStat(x, "LinearExtensionCount"). The head's page has its examples.
Live
Distribution
Over BinaryTrees at each size, tallied here in your browser; sizes past 6 are not offered.
Also on
The same name on other carriers, each its own implementation: OrderedTree.
FindStat St000045
The number of linear extensions of a binary tree.
| Object | Value |
|---|---|
[.,[.,[.,.]]] | 1 |
[.,[[.,.],.]] | 1 |
[[.,.],[.,.]] | 2 |
[[.,[.,.]],.] | 1 |
[[[.,.],.],.] | 1 |
[.,[.,[.,[.,.]]]] | 1 |
[.,[.,[[.,.],.]]] | 1 |
[.,[[.,.],[.,.]]] | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000045 has the rest.