Unit form recognition by mutations: application of mutations in the search of positive roots
From MaRDI portal
Publication:2659074
Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of representation theory (05E10) Combinatorial aspects of groups and algebras (05E16) Forms and linear algebraic groups (11E99) Representations of quivers and partially ordered sets (16G20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- A Coxeter-Gram classification of positive simply laced edge-bipartite graphs
- A polynomial recognition of unit forms using graph-based strategies
- Algorithms for weakly nonnegative quadratic forms
- Cluster algebras. I: Foundations
- Congruences of edge-bipartite graphs with applications to Grothendieck group recognition. II: Coxeter type study
- Cubic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
- Ice quivers with potential associated with triangulations and Cohen-Macaulay modules over orders
- Mesh algorithms for Coxeter spectral classification of Cox-regular edge-bipartite graphs with loops. I: Mesh root systems
- On maximal green sequences.
- On the \(c\)-vectors of an acyclic cluster algebra
- Quadratic forms. Combinatorics and numerical results
- Quivers with potentials and their representations II: Applications to cluster algebras
- Signed graphs
- Symbolic algorithms computing Gram congruences in the Coxeter spectral classification of edge-bipartite graphs. I. A Gram classification
- Tame algebras and Tits quadratic forms.
- The Dynkin type of a non-negative unit form.
Cited in
(3)
This page was built for publication: Unit form recognition by mutations: application of mutations in the search of positive roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659074)