A polynomial recognition of unit forms using graph-based strategies

DOI10.1016/j.dam.2018.06.018zbMath1404.16011MaRDI QIDQ1634765

Jesmmer Alves, Diane Castongay, Thomas Brüstle

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.018

zbMATH Keywords

graph; polynomial algorithm; integral quadratic form; unit form; critical unit form; hypercritical unit form

Mathematics Subject Classification ID

16G60: Representation type (finite, tame, wild, etc.) of associative algebras

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

16G20: Representations of quivers and partially ordered sets

15A63: Quadratic and bilinear forms, inner products

Related Items

On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs, 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

Cites Work

• Unnamed Item
• Unnamed Item
• \(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach
• Tame algebras and Tits quadratic forms.
• On weakly positive unit forms
• Signed graphs
• Coxeter transformations and representations of partially ordered sets
• Algorithms for weakly nonnegative quadratic forms
• A Coxeter--Gram Classification of Positive Simply Laced Edge-Bipartite Graphs
• Algebras whose Tits form accepts a maximal omnipresent root
• Tree algebras with non-negative tits form
• On Weakly Non-Negative Unit forms and Tame Algebras
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition II. Coxeter Type Study*
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification