On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs

DOI10.1016/J.LAA.2020.10.016zbMATH Open1460.05080OpenAlexW3094226520WikidataQ114152122 ScholiaQ114152122MaRDI QIDQ2228131FDOQ2228131

Katarzyna Zając, Daniel Simson

Publication date: 16 February 2021

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

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

zbMATH Keywords

Coxeter spectrumDynkin typeGram matrixGram congruenceedge-bipartite signed graphmesh translation quiversand-glass tubetoroidal extension

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Congruences of a square matrix and its transpose
• Introduction to Lie Algebras and Representation Theory
• Tame algebras and integral quadratic forms
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
• Systems of subspaces of a unitary space
• The Dynkin type of a non-negative unit form.
• On the structure of loop-free non-negative edge-bipartite graphs
• 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
• A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
• 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
• Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots
• Eigenvalues of coxeter transformations and the structure of regular componentsof an auslander-reiten quiver
• 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
• 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
• Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
• 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
• \(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach
• Mesh geometries of root orbits of integral quadratic forms
• Tubes in derived categories and cyclotomic factors of the Coxeter polynomial of an algebra.
• 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 computation of positive one-peak posets that are Tits-sincere
• On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\)
• A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
• Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices
• Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots
• Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition II. Coxeter Type Study*
• Quasi-Artin species and rings of finite representation type
• Quadratic forms. Combinatorics and numerical results
• Cubic Algorithm to Compute the Dynkin Type of a Positive Definite Quasi-Cartan Matrix
• 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\)
• Root systems and inflations of non-negative quasi-Cartan matrices
• A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
• Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops

Cited In (7)

• 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
• Two-connected signed graphs with maximum nullity at most two
• Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
• Congruence of rational matrices defined by an integer matrix
• Mesh algorithms for Coxeter spectral classification of Cox-regular edge-bipartite graphs with loops. I: Mesh root systems
• Signed graphs with maximum nullity two

Uses Software

• Maple
• Python
• TUBULAR

This page was built for publication: On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228131)