Related papers: A Formula for the Determinant
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We present a quantum algorithm for estimating the matrix determinant based on quantum spectral sampling. The algorithm estimates the logarithm of the determinant of an $n \times n$ positive sparse matrix to an accuracy $\epsilon$ in time…
We identify and analyse obstructions to factorisation of integer matrices into products $N^T N$ or $N^2$ of matrices with rational or integer entries. The obstructions arise as quadratic forms with integer coefficients and raise the…
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also…
A formula expressing the fermionic determinant (a large order polynomial) as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and…
In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…
The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…
In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…
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…
An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…
For any positive integer $n$, let ${\rm C}_{n}$ be the cyclic group of order $n$. We determine all possible values of the integer group determinant of ${\rm C}_{2}^{2} \rtimes C_{4}$.
A formula expressing the fermionic determinant as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and are indexed by loops of…
We describe calculations of Jarlskog's determinant in the case of n=3,4 in detail. Next, we investigate some formulas for invariant phases of unitary matrices and derive some explicit relations of them.
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
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…
We give a deterministic algorithm that, given a composite number $N$ and a target order $D \ge N^{1/6}$, runs in time $D^{1/2+o(1)}$ and finds either an element $a \in \mathbb{Z}_N^*$ of multiplicative order at least $D$, or a nontrivial…
Let $\{a_k\}$ be a sequence of real numbers defined by an $m$th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix $A=circ(a_1, a_2, \cdots, a_n)$, providing a generalization…
We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…
A square matrix is $k$-Toeplitz if its diagonals are periodic sequences of period $k$. We find universal formulas for the determinant, the characteristic polynomial, some eigenvectors, and the entries of the inverse of any tridiagonal…