相关论文: Cauchy-Binet for Pseudo-Determinants

The walk matrix of an $n$-vertex graph $G$ with adjacency matrix $A$, denoted by $W(G)$, is $[e,Ae,\ldots,A^{n-1}e]$, where $e$ is the all-ones vector. Let $G\circ P_m$ be the rooted product of $G$ and a rooted path $P_m$ (taking an…

We construct a Cartesian product G x H for finite simple graphs. It satisfies the Kuenneth formula: H^k(G x H) is a direct sum of tensor products H^i(G) x H^j(G) with i+j=k and so p(G x H,x) = p(G,x) p(H,y) for the Poincare polynomial…

Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$,…

A {\it tiered graph} $G=(V,E)$ with $m $ tiers is a simple graph with $V\subseteq \brk{n}$, where $\brk{n}=\{1,2,\cdots,n\}$, and with a surjective map $t$ from $V$ to $\brk{m}$ such that if $v$ is a vertex adjacent to $v'$ in $G$ with…

Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical…

Cauchy's determinant formula (1841) involving $\det ((1-u_i v_j)^{-1})$ is a fundamental result in symmetric function theory. It has been extended in several directions, including a determinantal extension by Frobenius [J. reine angew.…

The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial…

In 1951 paper \cite{Ki} Kippenhahn conjectured that if the characteristic polynomial \ $P_A(x_1,x_2,x_3)=\mbox{det}(x_1A_1+x_2A_2-x_3I)$, \ where $A_1$ and $A_2$ are $n\times n$ Hermitian matrices, has a repeated factor in the polynomial…

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…

In this article, we use Lindstr\"om Gessel Viennot Lemma to give a short, combinatorial, visualizable proof of the identity of Schur polynomials -- the sum of monomials of Young tableaux equals to the quotient of determinants. As a…

Let $\det_2(A)$ be the block-wise determinant (partial determinant). We consider the condition for completing the determinant $\det(\det_2(A)) = \det(A),$ and characterize the case for an arbitrary Kronecker product $A$ of matrices over an…

In this paper, we address computation of the degree $\mathop{\rm deg Det} A$ of Dieudonn\'e determinant $\mathop{\rm Det} A$ of \[ A = \sum_{k=1}^m A_k x_k t^{c_k}, \] where $A_k$ are $n \times n$ matrices over a field $\mathbb{K}$, $x_k$…

For an $n$-vertex graph $G$, the walk matrix of $G$, denoted by $W(G)$, is the matrix $[e,A(G)e,\ldots,(A(G))^{n-1}e]$, where $A(G)$ is the adjacency matrix of $G$ and $e$ is the all-ones vector. For two integers $m$ and $\ell$ with $1\le…

In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…

The connection zeta function of a finite abstract simplicial complex G is defined as zeta_L(s)=sum_x 1/lambda_x^s, where lambda_x are the eigenvalues of the connection Laplacian L defined by L(x,y)=1 if x and y intersect and 0 else. (I) As…

We prove a formula for a characteristic polynomial of an operator expressed as a polynomial of rank 1 operators. The formula uses a discrete analog of path integration and implies a generalization of the Forman-Kenyon's formula [4,6] for a…

We define two families of determinantal random spanning subgraphs of a finite connected graph, one supported by acyclic spanning subgraphs (spanning forests) with fixed number of connected components, the other by connected spanning…

Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…

Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields…

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…