Related papers: Algorithms for the Computing Determinants in Commu…
In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…
Effective matrix methods for solving standard linear algebra problems in a commutative domains are discussed. Two of them are new. There are a methods for computing adjoined matrices and solving system of linear equations in a commutative…
Circulant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal…
We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers.
We present here a new method for evaluating determinants -- the reduction method. Firstly, in the section 2, we apply it to third-order determinants and after, in the section 3, we generalize it to higher-order determinants. In the section…
We give new definitions for the determinant over commutative ring $K$, noncommutative ring $\mathbf{K}$, noncommutative ring $\mathcal{K}$ with associative powers, over noncommutative nonassociative ring $\mathfrak{K}$, and study their…
The best method for computing the adjoint matrix of an order $n$ matrix in an arbitrary commutative ring requires $O(n^{\beta+1/3}\log n \log \log n)$ operations, provided the complexity of the algorithm for multiplying two matrices is…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
This paper presents new approaches for finding the determinant and inverse of a matrix. The choice of pivot selection is kept arbitrary and can be made according to the users need. So the ill conditioned matrices can be handled easily. The…
Solution methods for linear equation systems in a commutative ring are discussed. Four methods are compared, in the setting of several different rings: Dodgson's method [1], Bareiss's method [2] and two methods of the author - method by…
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…
In this paper, we establish a determinantal formula for 2 x 2 matrix commutators [X,Y] = XY - YX over a commutative ring, using (among other invariants) the quantum traces of X and Y. Special forms of this determinantal formula include a…
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…
Based on geometric intuition, in this paper we are trying to give an idea and visualize the meaning of the determinants for the cubic-matrix. In this paper we have analyzed the possibilities of developing the concept of determinant of…
We present an overview of the existing methods for computing functional determinants, and outline a possible way forward for Hamiltonians of higher dimensions without radial symmetry.
In this paper we propose several strategies for the exact computation of the determinant of a rational matrix. First, we use the Chinese Remaindering Theorem and the rational reconstruction to recover the rational determinant from its…
This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…
We solve the problem of effectively computing the $a$-invariant of ladder determinantal rings. In the case of a one-sided ladder, we provide a compact formula, while, for a large family of two-sided ladders, we provide an algorithmic…
This article evaluates the determinants of two classes of special matrices, which are both from a number theory problem. Applications of the evaluated determinants can be found in [arXiv:math.NT/0509523]. Note that the two determinants are…