Inflation algorithms for positive and principal edge-bipartite graphs and unit quadratic forms
From MaRDI portal
(Redirected from Publication:2909626)
Recommendations
- On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
- Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
- Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
- Inflation algorithm for Cox-regular positive edge-bipartite graphs with loops
- Graph theoretical and algorithmic characterizations of positive definite symmetric quasi-Cartan matrices
Cited in
(24)- A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
- 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 framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
- A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
- 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
- On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
- Coxeter spectral classification of almost \(TP\)-critical one-peak posets using symbolic and numeric computations.
- On algorithmic Coxeter spectral analysis of positive posets
- A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
- On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\)
- Graph theoretical and algorithmic characterizations of positive definite symmetric quasi-Cartan matrices
- Cubic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
- Structure and a Coxeter-Dynkin type classification of corank two non-negative posets.
- Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs
- A graph theoretical framework for the strong Gram classification of non-negative unit forms of Dynkin type \(\mathbb{A}_n\)
- Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
- Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
- A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r
- Integer quadratic forms and extensions of subsets of linearly independent roots
This page was built for publication: Inflation algorithms for positive and principal edge-bipartite graphs and unit quadratic forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909626)