Algorithmic computation of principal posets using Maple and Python
From MaRDI portal
computer algorithmsCoxeter polynomialsCoxeter spectraedge-bipartite graphsGram matricesprincipal posetssimply-laced Dynkin diagramsunit quadratic forms
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorics of partially ordered sets (06A07) Algebraic aspects of posets (06A11) Quadratic and bilinear forms, inner products (15A63) Representations of quivers and partially ordered sets (16G20) Symbolic computation and algebraic computation (68W30)
Recommendations
- On algorithmic Coxeter spectral analysis of positive posets
- A Coxeter type classification of one-peak principal posets
- On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types
- A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- Coxeter spectral classification of almost \(TP\)-critical one-peak posets using symbolic and numeric computations.
Cited in
(19)- A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- On the structure of loop-free non-negative edge-bipartite graphs
- 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.
- Coxeter spectral classification of almost \(TP\)-critical one-peak posets using symbolic and numeric computations.
- The principal numbers of K. Saito for the types \(A_{l}, D_{l}\) and \(E_{l}\)
- On algorithmic Coxeter spectral analysis of positive posets
- A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
- On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types
- Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets
- 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
- A graph theoretical framework for the strong Gram classification of non-negative unit forms of Dynkin type \(\mathbb{A}_n\)
- The classification of serial posets with the non-negative quadratic Tits form being principal
- Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
- Right Buchberger algorithm over bijective skew \textit{PBW} extensions
- A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r
- Coxeter spectral classification of non-negative posets of Dynkin type \(\mathbb{E}_m\)
- Classification of the almost positive posets
This page was built for publication: Algorithmic computation of principal posets using Maple and Python
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173848)
