On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
From MaRDI portal
Publication:2192063
DOI10.1016/J.DAM.2019.12.002zbMath1442.05228OpenAlexW2998029102MaRDI QIDQ2192063
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.12.002
Gram matrixDynkin typeedge-bipartite graphextended Dynkin diagraminflation algorithm complexityweak Gram \(\mathbb{Z}\)-congruence
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (5)
On algorithmic Coxeter spectral analysis of positive posets ⋮ Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix ⋮ A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\) ⋮ A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices ⋮ Congruence of rational matrices defined by an integer matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
- Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
- \(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach
- Mesh geometries of root orbits of integral quadratic forms
- Tame algebras and integral quadratic forms
- On weakly positive unit forms
- A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
- A polynomial recognition of unit forms using graph-based strategies
- Graphical characterization of positive definite non symmetric quasi-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\)
- The Dynkin type of a non-negative unit form.
- On the structure of loop-free non-negative edge-bipartite graphs
- Root systems and inflations of non-negative quasi-Cartan matrices
- A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
- A Coxeter type classification of one-peak principal posets
- Serre type relations for complex semisimple Lie algebras associated to positive definite quasi-Cartan matrices
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
- Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems
- Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, II. Application to Coxeter Spectral Analysis
- A Coxeter--Gram Classification of Positive Simply Laced Edge-Bipartite Graphs
- A computation of positive one-peak posets that are Tits-sincere
- Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots
- Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices
- Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots
- Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops
- Cubic Algorithm to Compute the Dynkin Type of a Positive Definite Quasi-Cartan Matrix
- Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
- Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition II. Coxeter Type Study*
- Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification
- Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
This page was built for publication: On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
