Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification

From MaRDI portal
Publication:4976416

DOI10.3233/FI-2016-1345zbMath1371.05115OpenAlexW2346769286MaRDI QIDQ4976416

Daniel Simson

Publication date: 28 July 2017

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

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




Related Items (23)

A Gram classification of non-negative corank-two loop-free edge-bipartite graphsA class of highly symmetric graphs, symmetric cylindrical constructions and their spectraA Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithmA polynomial recognition of unit forms using graph-based strategiesCoxeter Invariants for Non-negative Unit Forms of Dynkin Type 𝔸rOn algorithmic Coxeter spectral analysis of positive posetsUnit form recognition by mutations: application of mutations in the search of positive rootsWeyl orbits of matrix morsifications and a Coxeter spectral classification of positive signed graphs and quasi-Cartan matrices of Dynkin type \(\mathbb{A}_n\)Symbolic 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 graphsA Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸rOn 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\)Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matricesApplications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problemInflation 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\)Coxeter energy of graphsCongruence of rational matrices defined by an integer matrixA Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸n






This page was built for publication: Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification