A Formula for the Determinant

05/31/2022
by   Nicholas Pippenger, et al.
0

We give a formula for the determinant of an n× 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 elements; in particular it requires no divisions or conditional branching (as are required, for example, by Gaussian elimination). The number of operations performed is bounded by a fixed power of n, specifically O(n^4log n). Furthermore, the operations can be partitioned into "stages" in such a way that the operands of the operations in a given stage are either matrix entries or the results of operations in earlier stages, and the number of stages is bounded by a fixed power of the logarithm of n, specifically O((log n)^2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2023

Correcting matrix products over the ring of integers

Let A, B, and C be three n× n matrices. We investigate the problem of ve...
research
11/26/2017

Computation of the Adjoint Matrix

The best method for computing the adjoint matrix of an order n matrix in...
research
04/02/2020

Power Hadamard matrices and Plotkin-optimal p-ary codes

A power Hadamard matrix H(x) is a square matrix of dimension n with entr...
research
07/29/2018

Optimum Depth of the Bounded Pipeline

The paper is devoted to studying the performance of a computational pipe...
research
04/02/2020

Power Hadamard matrices and Plotkin-optimal p^k-ary codes

A power Hadamard matrix H(x) is a square matrix of dimension n with entr...
research
10/19/2020

Green functions of Energized complexes

If h is a ring-valued function on a simplicial complex G we can define t...
research
03/19/2018

The Cohomology for Wu Characteristics

While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu ch...

Please sign up or login with your details

Forgot password? Click here to reset