Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups

DOI10.1016/j.cam.2013.07.013zbMath1314.05196OpenAlexW1977773351MaRDI QIDQ2349672

Daniel Simson, Mariusz Felisiak, Rafał Bocian

Publication date: 17 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.07.013

zbMATH Keywords

computer algorithmDynkin diagramCoxeter polynomialmatrix morsificationedge-bipartite graphmesh geometry of roots

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computer aspects of numerical algorithms (65Y99)

Related Items

A Gram classification of non-negative corank-two loop-free edge-bipartite graphs ⋮ A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm ⋮ Coxeter Invariants for Non-negative Unit Forms of Dynkin Type 𝔸r ⋮ On algorithmic Coxeter spectral analysis of positive posets ⋮ Weyl orbits of matrix morsifications and a Coxeter spectral classification of positive signed graphs and quasi-Cartan matrices of Dynkin type \(\mathbb{A}_n\) ⋮ Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops ⋮ A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r ⋮ Periodicity in bilinear lattices and the Coxeter formalism ⋮ 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 matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs ⋮ Computation of isotopisms of algebras over finite fields by means of graph invariants ⋮ Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two ⋮ 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\) ⋮ On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.

Uses Software

• Maple
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\)
• 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
• Schurian sp-representation-finite right peak PI-rings and their indecomposable socle projective modules
• Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets
• Signed graphs
• Posets of finite prinjective type and a class of orders
• Tame prinjective type and Tits form of two-peak posets. II
• Chain categories of modules and subprojective representations of posets over uniserial algebras.
• A condition for a graph to contain \(k\)-matching.
• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
• Congruences of a square matrix and its transpose
• Systems of subspaces of a unitary space
• One-peak posets with positive quadratic Tits form, their mesh translation quivers of roots, and programming in Maple and Python
• On the periodicity of Coxeter transformations and the non-negativity of their Euler forms
• Additive functions on trees
• A Framework for Coxeter Spectral Analysis of Edge-bipartite Graphs, their Rational Morsifications and Mesh Geometries of Root Orbits
• Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$
• Computer Algebra Technique for Coxeter Spectral Study of Edge-bipartite Graphs and Matrix Morsifications of Dynkin Type $\mathbb{A}_n$
• 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
• Incidence coalgebras of intervally finite posets, their integral quadratic forms and comodule categories
• Eigenvalues of coxeter transformations and the structure of regular componentsof an auslander-reiten quiver
• Lie algebras associated with quadratic forms and their applications to Ringel-Hall algebras
• Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams
• Introduction to Lie Algebras and Representation Theory

This page was built for publication: Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups