相关论文: Evaluating Two Determinants
We present a new approach to compute selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. Our method requires computing generalized eigenvalue problems of the same size as the matrices of the initial two-parameter…
This educational article highlights the geometric and algebraic complexities that distinguish tensors from matrices, to supplement coverage in advanced courses on linear algebra, matrix analysis, and tensor decompositions. Using the case of…
In this paper we examine the possibility of describing omitting types 1 and 2 by two at most ternary terms and any number of linear identities. All possible cases of systems of linear identities on two at most ternary terms are being…
We formulate the problem of finding 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…
Recently, Bie\~{n} [A. Bie\~{n}, The problem of singularity for planar grids, Discrete Math. 311 (2011), 921--931] obtained a recursive formula for the determinant of a grid. Also, recently, Pragel [D. Pragel, Determinants of box products…
Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…
Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…
Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is…
The question of defining unique, generally applicable constrained second, and higher-order, derivatives is investigated. It is shown that second-order constrained derivatives obtained via two successive constrained differentiations provide…
The determinants of modular Collatz graphs and the modular Conway amusical permutation graph are determined, and some interesting number theoretic properties are described.
Determinantal varieties -- the sets of bounded-rank matrices or tensors -- have attracted growing interest in low-rank optimization. The tangent cone to low-rank sets is widely studied and underpins a range of geometric methods. The…
The research aims to construct a new type of matrix called the Fibonacci-Hessenberg-Lorentz matrix by multiplying Fibonacci-Hessenberg matrices with Lorentz matrix multiplication. The study will start by examining the properties of…
The present work has been designed for students in secondary school and their teachers in mathematics. We will show how with the help of our knowledge of number systems we can solve problems from other fields of mathematics for example in…
The probability of the small deviations of the matrix $AA^T$ determinant is estimated, where $A$ is an $n\times\infty$ random matrix with centered entries having joint Gaussian distribution. The inequality obtained is sharp in a sence.
The Drazin inverse solutions of the matrix equations ${\rm {\bf A}}{\rm {\bf X}} = {\rm {\bf B}}$, ${\rm {\bf X}}{\rm {\bf A}} = {\rm {\bf B}}$ and ${\rm {\bf A}}{\rm {\bf X}}{\rm {\bf B}} ={\rm {\bf D}} $ are considered in this paper. We…
We prove an identity relating the permanent of a rank $2$ matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the…
A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…
In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection between critical points of the likelihood function on the complex variety of matrices of rank r and critical points on the complex variety of…