Graph theoretical and algorithmic characterizations of positive definite symmetric quasi-Cartan matrices (Q4589248)
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: Graph theoretical and algorithmic characterizations of positive definite symmetric quasi-Cartan matrices |
scientific article; zbMATH DE number 6804766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph theoretical and algorithmic characterizations of positive definite symmetric quasi-Cartan matrices |
scientific article; zbMATH DE number 6804766 |
Statements
Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (English)
0 references
9 November 2017
0 references
positive unit forms
0 references
Dynkin-type
0 references
edge-bipartite graphs
0 references
combinatorial algorithms
0 references
0.8778629302978516
0 references
0.8680504560470581
0 references
0.8407022953033447
0 references
0.820294201374054
0 references
