On algorithmic Coxeter spectral analysis of positive posets

DOI10.1016/j.amc.2020.125507zbMath1497.05146OpenAlexW3045006221MaRDI QIDQ2656718

Marcin Gąsiorek

Publication date: 16 March 2021

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

Full work available at URL: https://doi.org/10.1016/j.amc.2020.125507

zbMATH Keywords

numerical algorithmspectral graph theoryCoxeter spectrumDynkin typeedge-bipartite graphpositive poset

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem ⋮ Congruence of rational matrices defined by an integer matrix

Uses Software

• Maple
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On the derived category of a finite-dimensional algebra
• Coxeter transformation and inverses of Cartan matrices for coalgebras.
• 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
• Coxeter transformations and representations of partially ordered sets
• Posets of finite prinjective type and a class of orders
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
• Graphical characterization of positive definite non symmetric quasi-Cartan matrices
• Representation-finite Birkhoff type problems for nilpotent linear operators
• Quadratic forms. Combinatorics and numerical results
• 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\)
• A reduction functor, tameness, and Tits form for a class of orders
• 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 polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
• On the structure of loop-free non-negative edge-bipartite graphs
• Root systems and inflations of non-negative quasi-Cartan matrices
• A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
• A Coxeter type classification of one-peak principal posets
• 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
• Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
• 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.
• Tame-wild dichotomy of Birkhoff type problems for nilpotent linear operators.
• 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
• On Algorithmic Study of Non-negative Posets of Corank at Most Two and their Coxeter-Dynkin Types
• Graph Theory
• 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
• Eigenvalues of coxeter transformations and the structure of regular componentsof an auslander-reiten quiver
• 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
• Cubic Algorithm to Compute the Dynkin Type of a Positive Definite Quasi-Cartan Matrix
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition II. Coxeter Type Study*
• 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
• The Transitive Reduction of a Directed Graph

This page was built for publication: On algorithmic Coxeter spectral analysis of positive posets