Edge reduction for unit forms
We give an algorithm which decides whether or not an integral quadratic form \(q: \mathbb{Z}^n\to \mathbb{Z}\) of the form \(q(x)= \sum_i x_i^2+ \sum_{i<j} q_{ij} x_i x_j\) (unit form) is weakly positive, that is, satisfies \(q(x)> 0\) for all \(0\neq x\in \mathbb{N}^n\); if this is the case we obtain an explicit description of the set \(R_q= \{x\in \mathbb{N}^n\mid q(x)= 1\}\) of positive roots of \(q\). The presented algorithm is an adaptation of the `edge reduction' algorithm formulated originally by \textit{A. V. Roiter} and \textit{M. M. Kleiner} for DGC's and bocses [Lect. Notes Math. 488, 316-339 (1975; Zbl 0356.16011)].
- Algebras and Quadratic Forms
- Coxeter transformations and representations of partially ordered sets
- scientific article; zbMATH DE number 3702853 (Why is no real title available?)
- scientific article; zbMATH DE number 3554443 (Why is no real title available?)
- Prinjective Modules, Reflection Functors, Quadratic Forms, and Auslander-Reiten Sequences
- Edge reduction for weakly non-negative quadratic forms
- Incidence graphs and non-negative integral quadratic forms
- Algorithms for weakly nonnegative quadratic forms
- On \(\tau \)-tilting finite simply connected algebras
- Unit form recognition by mutations: application of mutations in the search of positive roots
- Conservative properties of unit quadratic forms
- scientific article; zbMATH DE number 1361363 (Why is no real title available?)
- The converse of Drozd’s theorem on quadratic forms
- A polynomial recognition of unit forms
- A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r
This page was built for publication: Edge reduction for unit forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901970)
