Tree Matrices and a Matrix Reduction Algorithm of Belitskii
Fundamenta Informaticae
Inflation Algorithms for Positive and Principal Edge-bipartite Graphs and Unit Quadratic Forms
Fundamenta Informaticae
Journal of Computational and Applied Mathematics
On the Computational Complexity of Bongartz's Algorithm
Fundamenta Informaticae
Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$
Fundamenta Informaticae
Hi-index | 0.00 |
We study integral solutions of diophantine equations q(x) = d, where x = (x 1, . . . , x n), n ≥ 1, d ∈ \mathbb{Z} is an integer and q : \mathbb{Z} n → \mathbb{Z} is a non-negative homogeneous quadratic form. Contrary to the negative solution of the Hilbert's tenth problem, for any such a form q(x), we give efficient algorithms describing the set ℛ q(d) of all integral solutions of the equation q(x) = d in a Φ A-mesh translation quiver form. We show in Section 5 that usually the set ℛ q(d) has a shape of a Φ A-mesh sand-glass tube or of a Φ A-mesh torus, see 5.8, 5.10, and 5.13. If, in addition, the subgroup Ker q = {v ∈ \mathbb{Z} n; q(v) = 0} of \mathbb{Z} n is infinite cyclic, we study the solutions of the equations q(x) = 1 by applying a defect δ A : \mathbb{Z} n → \mathbb{Z} and a reduced Coxeter number č A ∈ \mathbb{N} defined by means of a morsification b A : \mathbb{Z} n × \mathbb{Z} n → \mathbb{Z} of q, see Section 4. On this way we get a simple graphical algorithm that constructs all integral solutions in the shape of a mesh translation oriented graph consisting of Coxeter Φ A-orbits. It turns out that usually the graph has at most three infinite connected components and each of them has an infinite band shape, or an infinite horizontal tube shape, or has a sand-glass tube shape. The results have important applications in representation theory of groups, algebras, quivers and partially ordered sets, as well as in the study of derived categories (in the sense of Verdier) of module categories and categories of coherent sheaves over algebraic varieties.