Related papers: Goeritz and Seifert Matrices from Dehn Presentatio…
In this paper, we consider Gaussian models Markov with respect to an arbitrary DAG. We first construct a family of conjugate priors for the Cholesky parametrization of the covariance matrix of such models. This family has as many shape…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
Connections between Lie derivatives and the deviation equation has been investigated in spaces with affine connection. The deviation equations of the geodesics as well as deviation equations of non-geodesics trajectories have been obtained…
How could the Fourier and other transforms be naturally discovered if one didn't know how to postulate them? In the case of the Discrete Fourier Transform (DFT), we show how it arises naturally out of analysis of circulant matrices. In…
We are given the adjacency matrix of a geometric graph and the task of recovering the latent positions. We study one of the most popular approaches which consists in using the graph distances and derive error bounds under various…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
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 girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…
A mock Seifert matrix is an integral square matrix representing the Gordon-Litherland form of a pair $(K,F)$, where $K$ is a knot in a thickened surface and $F$ is an unoriented spanning surface for $K$. Using these matrices, we introduce a…
A new powerful method to calculate Feynman diagrams is proposed. It consists in setting up a Taylor series expansion in the external momenta squared (in general multivariable). The Taylor coefficients are obtained from the original diagram…
In this article we construct examples of derivations in matrix semirings. We study hereditary and inner derivations, derivatives of diagonal, triangular, Toeplitz, circulant matrices and of matrices of other forms and prove theorems for…
We elaborate on the connection between Gel'fand-Kapranov-Zelevinsky systems, de Rham theory for twisted cohomology groups, and Pfaffian equations for Feynman integrals. We propose a novel, more efficient algorithm to compute Macaulay…
The G-Wishart distribution is an essential component for the Bayesian analysis of Gaussian graphical models as the conjugate prior for the precision matrix. Evaluating the marginal likelihood of such models usually requires computing…
We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…
For any given graph $G$ consider a graph $\widetilde{G}$ which is a cone over graph $G.$ In this paper, we study two important invariants of such a cone. Namely, complexity (the number of spanning trees) and the Jacobian of a graph. We…
Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line…
The maximal algebras of scalar Toeplitz matrices are known to be formed by generalized circulants. The identification of algebras consisting of block Toeplitz matrices is a harder problem, that has received little attention up to now. We…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
The way to arrive at formula of zeta matrix for any graded posets with the finite set of minimal elements is delivered following the first reference. This is being achieved via adjacency and zeta matrix description of bipartite digraphs…
Recently Kearton showed that any Seifert matrix of a knot is S--equivalent to the Seifert matrix of a prime knot. We show in this note that such a matrix is in fact S--equivalent to the Seifert matrix of a hyperbolic knot. This result…