A Gram classification of non-negative corank-two loop-free edge-bipartite graphs

DOI10.1016/j.laa.2016.03.007zbMath1334.05053OpenAlexW2304308747MaRDI QIDQ272348

Daniel Simson, Marcin Gąsiorek, Katarzyna Zając

Publication date: 20 April 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.007

zbMATH Keywords

Gram matrixCoxeter polynomialCoxeter spectrumDynkin typeedge-bipartite graph of corank two

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quadratic and bilinear forms, inner products (15A63) Algebraic aspects of posets (06A11) Signed and weighted graphs (05C22)

Related Items (12)

A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm ⋮ 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 ⋮ A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r ⋮ 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\) ⋮ Coxeter energy of graphs

Uses Software

• Maple
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• \(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach
• Mesh geometries of root orbits of integral quadratic forms
• Algebras whose Coxeter polynomials are products of cyclotomic polynomials.
• Tubes in derived categories and cyclotomic factors of the Coxeter polynomial of an algebra.
• Periodicity in bilinear lattices and the Coxeter formalism
• Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets
• A Chebysheff recursion formula for Coxeter polynomials
• Signed graphs
• Algebra VIII: Representations of finite-dimensional algebras. Transl. from the Russian
• Coxeter transformations and representations of partially ordered sets
• Spectral properties of Coxeter transformations and applications
• Isotropic vectors of non-negative integral quadratic forms
• Towards the classification of sincere weakly positive unit forms
• Canonical matrices for linear matrix problems
• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
• Congruences of a square matrix and its transpose
• Methods to determine Coxeter polynomials
• Systems of subspaces of a unitary space
• A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
• The Dynkin type of a non-negative unit form.
• 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
• One-peak posets with positive quadratic Tits form, their mesh translation quivers of roots, and programming in Maple and Python
• Coxeter spectral classification of almost \(TP\)-critical one-peak posets using symbolic and numeric computations.
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
• Root-induced integral quadratic forms
• A Horizontal Mesh Algorithm for a Class of Edge-bipartite Graphs and their Matrix Morsifications
• 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
• Algorithms for Isotropy Groups of Cox-regular Edge-bipartite Graphs
• On Algorithmic Study of Non-negative Posets of Corank at Most Two and their Coxeter-Dynkin Types
• A Framework for Coxeter Spectral Analysis of Edge-bipartite Graphs, their Rational Morsifications and Mesh Geometries of Root Orbits
• A Coxeter--Gram Classification of Positive Simply Laced Edge-Bipartite Graphs
• Description of posets critical with respect to the nonnegativity of the quadratic Tits form
• (Min, max)-equivalence of posets and nonnegative Tits forms
• Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots
• Spectral analysis of finite dimensional algebras and singularities
• Eigenvalues of coxeter transformations and the structure of regular componentsof an auslander-reiten quiver
• COXETER FUNCTORS AND GABRIEL'S THEOREM
• 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, I. A Gram Classification
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
• Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams
• CLUSTER ALGEBRAS OF FINITE TYPE AND POSITIVE SYMMETRIZABLE MATRICES

This page was built for publication: A Gram classification of non-negative corank-two loop-free edge-bipartite graphs