Related papers: Trace identities for quiver representations
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…
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…
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
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…
We compute the canonical trace of generic determinantal rings and provide a sufficient condition for the trace to specialize. As an application we determine the canonical trace $\mbox{tr}(\omega_R)$ of a Cohen-Macaulay ring $R$ of…
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…
We introduce certain quiver analogue of the determinantal variety. We study the Kempf-Lascoux-Weyman's complex associated to a line bundle on the variety. In the case of generalized Kronecker quivers, we give a sufficient condition on when…
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…
In this paper we study a Kahler structure on finite points. In particular, we study the edge Laplacian of a graph twisted by the Kahler structure introduced in this paper. We also discuss a metric aspect from a twisted holomorphic…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
In this paper, we establish a determinantal formula for 2 x 2 matrix commutators [X,Y] = XY - YX over a commutative ring, using (among other invariants) the quantum traces of X and Y. Special forms of this determinantal formula include a…
We compute the curvature of the determinant line bundle on a family of Dirac operators for a noncommutative two torus. Following Quillen's original construction for Riemann surfaces and using zeta regularized determinant of Laplacians, one…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
The spectral theory of the Laplace differential operator for biregular quantum graphs is developed. Trees are studied in detail. Generating functions for closed non backtracking walks appear when resolvents for trees are related to…
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…
In this article, we evaluate determinants of block hook matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely. In addition we give a combinatorial…
In this paper, the Laplacian characteristic polynomial of uniform hypergraphs with cut vertices or pendant edges and the Laplacian matching polynomial of uniform hypergraphs are characterized.The multiplicity of the zero Laplacian…