Integer matrix factorisations, superalgebras and the quadratic form obstruction
نویسندگان
چکیده
We identify and analyse obstructions to factorisation of integer matrices into products NTN or N2 with rational entries. The arise as quadratic forms coefficients raise the question discrete range such forms. They are obtained by considering matrix decompositions over a superalgebra. further obtain formula for determinant square in terms adjugates these decompositions, well identifying co-Latin symmetry space.
منابع مشابه
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A n n the algorithm requires O n3 5 logn 4 5 bit operations (assuming for now that entries in A have constant size) using standard matrix and integer arithmetic. Using asymptotically fast matrix arithmetic, a variant is described which requires O n2 2 log2 n loglogn bit operations, wher...
متن کاملThe Smith Normal Form Distribution of A Random Integer Matrix
We show that the density μ of the Smith normal form (SNF) of a random integer matrix exists and equals a product of densities μps of SNF over Z/p sZ with p a prime and s some positive integer. Our approach is to connect the SNF of a matrix with the greatest common divisors (gcds) of certain polynomials of matrix entries, and develop the theory of multi-gcd distribution of polynomial values at a...
متن کاملThe Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions
It has been shown in a number of recent papers that Graver bases methods enable to solve linear and nonlinear integer programming problems in variable dimension in polynomial time, resulting in a variety of applications in operations research and statistics. In this article we continue this line of investigation and show that Graver bases also enable tominimize quadratic and higher degree polyn...
متن کاملOn e cient sparse integer matrix Smithnormal form computations
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of word-size primes. Consequently, the algorithm does not suuer from coef-cient growth. We have implemented several variants of this algorithm (Elimination and/or Black-Box techniques) since p...
متن کاملOn Efficient Sparse Integer Matrix Smith Normal Form Computations
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of word-size primes. Consequently, the algorithm does not suffer from coefficient growth. We have implemented several variants of this algorithm (Elimination and/or Black-Box techniques) since...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2021.03.028