Congruences of edge-bipartite graphs with applications to Grothendieck group recognition. II: Coxeter type study

DOI10.3233/FI-2016-1378zbMATH Open1367.05107OpenAlexW2521001849MaRDI QIDQ4976376FDOQ4976376

Authors: Andrzej Mróz 

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-1378

Recommendations

• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
• Symbolic algorithms computing Gram congruences in the Coxeter spectral classification of edge-bipartite graphs. I. A Gram classification
• 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\)
• On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other combinatorial number theory (11B75) Representations of associative Artinian rings (16G10) Grothendieck groups, (K)-theory, etc. (16E20)

Cited In (25)

• Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices
• Bounds related to Coxeter spectral measures of graphs
• Coxeter energy of graphs
• A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
• A Coxeter type classification of one-peak principal posets
• On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
• Root systems and inflations of non-negative quasi-Cartan matrices
• A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
• Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
• Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
• On algorithmic Coxeter spectral analysis of positive posets
• A polynomial recognition of unit forms using graph-based strategies
• Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
• Weyl orbits of matrix morsifications and a Coxeter spectral classification of positive signed graphs and quasi-Cartan matrices of Dynkin type \(\mathbb{A}_n\)
• Weyl roots and equivalences of integral quadratic forms
• Unit form recognition by mutations: application of mutations in the search of positive roots
• On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
• 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\)
• On the structure of loop-free non-negative edge-bipartite graphs
• Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
• A Coxeter-Gram classification of positive simply laced edge-bipartite graphs
• A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r

This page was built for publication: Congruences of edge-bipartite graphs with applications to Grothendieck group recognition. II: Coxeter type study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976376)