On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\)

DOI10.1016/J.DISC.2013.02.003zbMath1279.05033OpenAlexW2083987881MaRDI QIDQ389491

Daniel Simson, Mariusz Felisiak

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.02.003

zbMATH Keywords

MapleCoxeter numbercombinatorial algorithmDynkin diagramCoxeter polynomialmatrix morsificationmesh geometry

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Representations of quivers and partially ordered sets (16G20) Signed and weighted graphs (05C22)

Related Items (6)

Coxeter Invariants for Non-negative Unit Forms of Dynkin Type 𝔸r ⋮ 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 ⋮ Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two ⋮ Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups

Uses Software

• Unnamed Item
• 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\)
• Mesh geometries of root orbits of integral quadratic forms
• Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets
• Comodules of \(U_q(sl_2)\) and modules of \(\text{SL}_q(2)\) via quiver methods
• Unified tame theorem.
• Canonical matrices for linear matrix problems
• Complexity of matrix problems
• A reduction functor, tameness, and Tits form for a class of orders
• A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
• The Dynkin type of a non-negative unit form.
• One-peak posets with positive quadratic Tits form, their mesh translation quivers of roots, and programming in Maple and Python
• Periodic Coxeter matrices and their associated quadratic 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
• Rainbow induced subgraphs in proper vertex colorings
• Incidence coalgebras of intervally finite posets, their integral quadratic forms and comodule categories
• Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams

This page was built for publication: On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\)