Algorithms for non-crossing partitions (Q3429586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5139523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for non-crossing partitions |
scientific article; zbMATH DE number 5139523 |
Statements
2 April 2007
0 references
partially ordered sets
0 references
binary trees
0 references
group actions
0 references
0.790286660194397
0 references
0.7850167155265808
0 references
0.7850167155265808
0 references
0.7657904624938965
0 references
0.7637157440185547
0 references
