A polynomial recognition of unit forms using graph-based strategies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5254 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- A Coxeter-Gram classification of positive simply laced edge-bipartite graphs
- Algebras whose Tits form accepts a maximal omnipresent root.
- Algorithms for weakly nonnegative quadratic forms
- Congruences of edge-bipartite graphs with applications to Grothendieck group recognition. II: Coxeter type study
- Coxeter transformations and representations of partially ordered sets
- On Weakly Non-Negative Unit forms and Tame Algebras
- On weakly positive unit forms
- 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.
- Tree algebras with non-negative tits form
- \(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach
Cited in
(5)- A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
- Unit form recognition by mutations: application of mutations in the search of positive roots
- On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
- A polynomial recognition of unit forms
This page was built for publication: A polynomial recognition of unit forms using graph-based strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634765)