Computer Algebra Technique for Coxeter Spectral Study of Edge-bipartite Graphs and Matrix Morsifications of Dynkin Type $\mathbb{A}_n$

DOI10.3233/FI-2013-851zbMath1277.16040OpenAlexW1644217377MaRDI QIDQ2843813

Publication date: 26 August 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-851

zbMATH Keywords

symbolic computations Dynkin diagrams combinatorial algorithms Coxeter numbers Coxeter polynomials Euler quadratic forms matrix Morsifications reduced mesh root systems Weyl orbits

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Representations of quivers and partially ordered sets (16G20) Computational aspects of associative rings (general theory) (16Z05)

Related Items (8)

On algorithmic Coxeter spectral analysis of positive posets ⋮ On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram $\mathbb A_n$ ⋮ On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs ⋮ Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs ⋮ 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 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

Uses Software

Maple

This page was built for publication: Computer Algebra Technique for Coxeter Spectral Study of Edge-bipartite Graphs and Matrix Morsifications of Dynkin Type $\mathbb{A}_n$