On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types (Q2805472)
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: On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types |
scientific article; zbMATH DE number 6579385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types |
scientific article; zbMATH DE number 6579385 |
Statements
11 May 2016
0 references
poset
0 references
Coxeter spectrum
0 references
Dynkin diagram
0 references
Coxeter-Dynkin type
0 references
On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types (English)
0 references
0.8955801129341125
0 references
0.8923012018203735
0 references
0.8920224905014038
0 references
0.839300274848938
0 references
