2019/10/31 by Will Grilliette, Josephine Reynes, Lucas J. Rusnak · 1 citation
Computer Science · Mathematics · #Adjacency matrix #Characteristic polynomial #Combinatorics #Computational Drug Discovery Methods #Discrete mathematics #Eigenvalues and eigenvectors #Graph #Graph theory and applications #Incidence (geometry) #Incidence matrix #Injective function #Integer matrix #Line graph #Mathematics #Nonnegative matrix #Polynomial #Symmetric matrix #Topological and Geometric Data Analysis #Tutte polynomial #Voltage graph #math.CO #math.CT #msc:05B20 #msc:05C22 #msc:05C50 #msc:05C65 #msc:18A25
paper · pdf · doi:10.1016/j.laa.2021.10.023
published as Linear Algebra Appl. 634 (2022), 77-105 · 27 pages, 10 figures
arxiv created 2020/08/03 · openalex publication_date 2021/11/03 · arxiv updated 2021/12/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in the subobject classifier of incidence hypergraphs. Moreover, the injective envelope is calculated and shown to contain the class of uniform hypergraphs -- providing a combinatorial framework for the entries of incidence matrices. A multivariable all-minors characteristic polynomial is obtained for both the determinant and permanent of the oriented hypergraphic Laplacian and adjacency matrices arising from any integer incidence matrix. The coefficients of each polynomial are shown to be submonic maps from the same family into the injective envelope limited by the subobject classifier. These results provide a unifying theorem for oriented hypergraphic matrix-tree-type and Sachs-coefficient-type theorems. Finally, by specializing to bidirected graphs, the trivial subclasses for the degree-k monomials of the Laplacian are shown to be in one-to-one correspondence with k-arborescences.