Related papers: Calculating Determinants of Block Matrices
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
Differential resultant formulas are defined, for a system $\mathcal{P}$ of $n$ ordinary Laurent differential polynomials in $n-1$ differential variables. These are determinants of coefficient matrices of an extended system of polynomials…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
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 short note we deal with a constructive scheme to decompose a continuous family of matrices $A(\rho)$ asymptotically as $\rho\to0$ into blocks corresponding to groups of eigenvalues of the limit matrix A(0). We also discuss the…
The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…
We calculate the Hankel determinants of sequences of Bernoulli polynomials. This corresponding Hankel matrix comes from statistically estimating the variance in nonparametric regression. Besides its entries' natural and deep connection with…
Let $\cP$ be a system of $n$ linear nonhomogeneous ordinary differential polynomials in a set $U$ of $n-1$ differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in $U$ from…
We prove two inequalities regarding the ratio $\det(A+D)/\det A$ of the determinant of a positive-definite matrix $A$ and the determinant of its perturbation $A+D$. In the first problem, we study the perturbations that happen when positive…
In this article, we revisit some block matrix construction methods and use them to derive various general expansion formulas for calculating the ranks of matrix expressions. As applications, we derive a variety of interesting rank…
Based on a less-known result, we prove a recent conjecture concerning the determinant of a certain Sylvester-Kac type matrix and consider an extension of it.
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…
In the setting of polynomial jump-diffusion dynamics, we provide an explicit formula for computing correlators, namely, cross-moments of the process at different time points along its path. The formula appears as a linear combination of…
The determinant of a lower Hessenberg matrix (Hessenbergian) is expressed as a sum of signed elementary products indexed by initial segments of nonnegative integers. A closed form alternative to the recurrence expression of Hessenbergians…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
Almost all dependable systems use some form of redundancy in order to increase fault-tolerance. Very popular are the $N$-Modular Redundant (NMR) systems in which a majority voter chooses the voting output. However, elaborate systems require…
Designing component-based constraint solvers is a complex problem. Some components are required, some are optional and there are interdependencies between the components. Because of this, previous approaches to solver design and…
In this note we prove an assertion made by M. Levin in 1999: the Pascal matrix modulo 2 has the property that each of the square sub-matrices laying on the upper border or on the left border has determinants, computed in $\mathbb{Z}$, equal…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…