On algorithmic Coxeter spectral analysis of positive posets
From MaRDI portal
Publication:2656718
Recommendations
- A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types
- Coxeter spectral classification of almost \(TP\)-critical one-peak posets using symbolic and numeric computations.
- scientific article; zbMATH DE number 2065196
- On some classes of spectral posets
- On spectral theory of Coxeter graphs and its applications
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
- Positive semidefinite rank and nested spectrahedra
- A class of posets with integral Laplacian spectrum
- A new spectral sequence for homology of posets
Cites work
- scientific article; zbMATH DE number 463967 (Why is no real title available?)
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- scientific article; zbMATH DE number 5213223 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- 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 Coxeter type classification of one-peak principal posets
- A Coxeter-Gram classification of positive simply laced edge-bipartite graphs
- A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
- A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
- A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- A horizontal mesh algorithm for a class of edge-bipartite graphs and their matrix morsifications
- A reduction functor, tameness, and Tits form for a class of orders
- Algorithmic computation of principal posets using Maple and Python
- Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams
- An introduction to the theory of graph spectra
- Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs
- Coalgebras of tame comodule type, comodule categories, and a tame-wild dichotomy problem.
- Computer algebra technique for Coxeter spectral study of edge-bipartite graphs and matrix Morsifications of Dynkin type \(\mathbb A_n\).
- 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
- Coxeter spectral classification of almost \(TP\)-critical one-peak posets using symbolic and numeric computations.
- Coxeter transformation and inverses of Cartan matrices for coalgebras.
- Coxeter transformations and representations of partially ordered sets
- Cubic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
- 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
- Graph theory
- Graph theory
- Graphical characterization of positive definite non symmetric quasi-Cartan matrices
- Inflation algorithms for positive and principal edge-bipartite graphs and unit quadratic forms
- Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets
- 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
- Mesh geometries of root orbits of integral quadratic forms
- Numeric algorithms for corank two edge-bipartite graphs and their mesh geometries of roots
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
- On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
- On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types
- On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
- On the derived category of a finite-dimensional algebra
- On the structure of loop-free non-negative edge-bipartite graphs
- One-peak posets with positive quadratic Tits form, their mesh translation quivers of roots, and programming in Maple and Python
- Posets of finite prinjective type and a class of orders
- Quadratic forms. Combinatorics and numerical results
- Representation-finite Birkhoff type problems for nilpotent linear operators
- Root systems and inflations of non-negative quasi-Cartan matrices
- Schurian sp-representation-finite right peak PI-rings and their indecomposable socle projective modules
- Structure and a Coxeter-Dynkin type classification of corank two non-negative posets.
- Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
- Symbolic algorithms computing Gram congruences in the Coxeter spectral classification of edge-bipartite graphs. I. A Gram classification
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
- Systems of subspaces of a unitary space
- Tame-wild dichotomy of Birkhoff type problems for nilpotent linear operators.
- The Dynkin type of a non-negative unit form.
- The Transitive Reduction of a Directed Graph
Cited in
(7)- A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem
- A matrix analysis of carrier posets of biconnected graphs
- Congruence of rational matrices defined by an integer matrix
- On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
- Algorithmic computation of principal posets using Maple and Python
- On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types
This page was built for publication: On algorithmic Coxeter spectral analysis of positive posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656718)
