On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types

DOI10.3233/FI-2015-1238MaRDI QIDQ2805472zbMATH OpenOpenAlexFDO

Authors Marcin Gąsiorek, Katarzyna Zając

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1238

zbMATH Keywords

Coxeter spectrumposetDynkin diagramCoxeter-Dynkin type

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)

Recommendations

• Structure and a Coxeter-Dynkin type classification of corank two non-negative posets.
• On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
• On algorithmic Coxeter spectral analysis of positive posets
• Algorithmic computation of principal posets using Maple and Python
• A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.

Cited in

(18)

• A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
• A Coxeter type classification of one-peak principal posets
• On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
• A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
• Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
• Structure and a Coxeter-Dynkin type classification of corank two non-negative posets.
• Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
• On algorithmic Coxeter spectral analysis of positive posets
• Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
• A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
• Algorithmic computation of principal posets using Maple and Python
• 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\)
• 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.
• Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets
• Coxeter spectral classification of non-negative posets of Dynkin type \(\mathbb{E}_m\)
• Congruence of rational matrices defined by an integer matrix

This page was built for publication: On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types

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