Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems

From MaRDI portal
Publication:2805463

DOI10.3233/FI-2015-1230zbMath1335.05144OpenAlexW1261728726MaRDI QIDQ2805463

Stanisław Kasjan, Daniel Simson

Publication date: 11 May 2016

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

Full work available at URL: https://doi.org/10.3233/fi-2015-1230




Related Items (21)

A Gram classification of non-negative corank-two loop-free edge-bipartite graphsA Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithmWeyl roots and equivalences of integral quadratic formsCoxeter 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 rootsSymbolic 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 𝔸rPeriodicity in bilinear lattices and the Coxeter formalismQuadratic 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\)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 graphs


Uses Software





This page was built for publication: Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems