Related papers: Determinants and Perfect Matchings
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
The determinants of modular Collatz graphs and the modular Conway amusical permutation graph are determined, and some interesting number theoretic properties are described.
We prove that the following statements are equivalent: a linear matrix equation with parameters forming a commuting set of diagonalizable matrices is consistent, a certain matrix constructed with the Drazin inverse is a solution of this…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…
Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the…
We study a unitary analog to Redheffer's matrix. It is first proved that the determinant of this matrix is the unitary analogue to that of Redheffer's matrix. We also show that the coefficients of the characteristic polynomial may be…
This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…
Every square matrix $A=(a_{uv})\in \mathcal{C}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant…
We prove that the defining equations of the Fermat curves of prime degree cannot be written as the determinant of symmetric matrices with entries in linear forms in three variables with rational coefficients. In the proof, we use a relation…
For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…
Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…
Two known computation methods and one new computation method for matrix determinant over an integral domain are discussed. For each of the methods we evaluate the computation times for different rings and show that the new method is the…
A natural consequence of the fractional calculus is its extension to a matrix order of differentiation and integration. A matrix-order derivative definition and a matrix-order integration arise from the generalization of the gamma function…
We consider the following natural question. Given a matrix $A$ with i.i.d. random entries, what are the moments of the determinant of $A$? In other words, what is $\mathbb{E}[\det(A)^k]$? While there is a general expression for…
Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The foundation for the theory of correlation functions of exactly solvable models is determinant representation. Determinant representation permit to describe correlation functions by classical completely integrable differential equations…
A left-unilateral matrix equation is an algebraic equation of the form $$ a_0+a_1 x+a_2 x^2+... +a_n x^n=0 $$ where the coefficients $a_r$ and the unknown $x$ are square matrices of the same order and all coefficients are on the left…
We consider square matrices A that commute with a fixed square matrix K, both with entries in a field F not of characteristic 2. When K^2=I, Tao and Yasuda defined A to be generalized centrosymmetric with respect to K. When K^2=-I, we…