Related papers: Determinants of Block Matrices with Noncommuting B…
We define a random commuting $d$-tuple of $n$-by-$n$ matrices to be a random variable that takes values in the set of commuting $d$-tuples and has a distribution that is a rapidly decaying continuous weight on this algebraic set. In the…
Given a trigonometric polynomial f:[0,1]\to[0,1] of degree m, one can define a corresponding stationary process {X_i}_{i\in Z} via determinants of the Toeplitz matrix for f. We show that for m=1 this process, which is trivially…
In the framework of model-based clustering, a model allowing several latent class variables is proposed. This model assumes that the distribution of the observed data can be factorized into several independent blocks of variables. Each…
A system of one-dimensional Brownian motions (BMs) conditioned never to collide with each other is realized as (i) Dyson's BM model, which is a process of eigenvalues of hermitian matrix-valued diffusion process in the Gaussian unitary…
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
We call a ring R pointwise semicommutative if for any element a in R either l(a) or r(a) is an ideal of R. A class of pointwise semicommutative rings is a strict generalization of semicommutative rings. Since reduced rings are pointwise…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, used definition has special features which make…
We prove that row reducing a quantum matrix yields another quantum matrix for the same parameter q. This means that the elements of the new matrix satisfy the same relations as those of the original quantum matrix ring M_q(n). As a…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
Precision tests of the Standard Model and searches for beyond the Standard Model physics often require nuclear structure input. There has been a tremendous progress in the development of nuclear ab initio techniques capable of providing…
A square matrix of order $n$ with $n\geq 2$ is called a \textit{permutative matrix} or permutative when all its rows (up to the first one) are permutations of precisely its first row. In this paper, the spectra of a class of permutative…
Given two elements $a$ and $b$ of a noncommutative ring, we express $\left( ba\right)^n$ as a "row vector times matrix times column vector" product, where the matrix is the $n$-th power of a matrix with entries…
The necessary and suffcient condition for a set of matrices to commute is given and proven.
An element of a ring $R$ is strongly $P$-clean provided that it can be written as the sum of an idempotent and a strongly nilpotent element that commute. A ring $R$ is strongly $P$-clean in case each of its elements is strongly $P$-clean.…
Consider the $2n$-by-$2n$ matrix $M=(m_{i,j})_{i,j=1}^{2n}$ with $m_{i,j} = 1$ for $i,j$ satisfying $|2i-2n-1|+|2j-2n-1| \leq 2n$ and $m_{i,j} = 0$ for all other $i,j$, consisting of a central diamond of 1's surrounded by 0's. When $n \geq…
This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…
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…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…