Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices

From MaRDI portal
Publication:4589248

DOI10.3233/FI-2016-1448zbMath1374.68235OpenAlexW2563204801MaRDI QIDQ4589248

Mario Abarca, Daniel E. Rivera

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1448




Related Items (15)

A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithmOn algorithmic Coxeter spectral analysis of positive posetsSerre type relations for complex semisimple Lie algebras associated to positive definite quasi-Cartan matricesSymbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loopsOn polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphsGraphical characterization of positive definite non symmetric quasi-Cartan matricesQuadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrixOn mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphsA Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan CompanionInflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least twoOn the structure of loop-free non-negative edge-bipartite graphsRoot systems and inflations of non-negative quasi-Cartan matricesA computational technique in Coxeter spectral study of symmetrizable integer Cartan matricesA Coxeter spectral classification of positive edge-bipartite graphs. I: Dynkin types \(\mathcal{B}_n\), \(\mathcal{C}_n\), \(\mathcal{F}_4\), \(\mathcal{G}_2\), \(\mathbb{E}_6\), \(\mathbb{E}_7\), \(\mathbb{E}_8\)




This page was built for publication: Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices