Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots
From MaRDI portal
Publication:4595593
DOI10.3233/FI-2017-1518zbMath1375.05167OpenAlexW2604988676MaRDI QIDQ4595593
Publication date: 5 December 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2017-1518
Combinatorial aspects of representation theory (05E10) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Representations of quivers and partially ordered sets (16G20) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (11)
On algorithmic Coxeter spectral analysis of positive posets ⋮ Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops ⋮ On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs ⋮ On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs ⋮ A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\) ⋮ Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem ⋮ Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two ⋮ On the structure of loop-free non-negative edge-bipartite graphs ⋮ A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices ⋮ A 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\) ⋮ A Coxeter type classification of one-peak principal posets
This page was built for publication: Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots
