Matrices over finite fields and their Kirchhoff graphs

DOI10.1016/J.LAA.2018.02.020MaRDI QIDQ1747897zbMATH OpenOpenAlexWikidataFDO

Authors Tyler M. Reese, Joseph D. Fehribach, Randy C. Paffenroth, Brigitte Servatius

Publication date 27 April 2018

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2018.02.020

zbMATH Keywords

Cayley color graphfinite fieldKirchhoff graphmatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Review text

Kirchhoff's laws are well known for electrical networks. They can be characterized by the circuit matrix and the cutset matrix of the associated network graph. Likewise, an electrochemical reaction network can be encoded by an integer-valued matrix called the stoichiometric matrix, the columns of which correspond to reaction steps. In particular, given this matrix, what is a suitable graphic rendering of a network that properly visualizes the underlying chemical reactions? This paper extends previous work on Kirchhoff graphs for matrices over the rationals to matrices over finite fields. It is shown that for any integer-valued matrix, there exists a nontrivial \(\mathbb{Z}_p\)-Kirchhoff graph for the matrix (mod \(p\)) for sufficiently large prime \(p\). Moreover, nonzero \(\mathbb{Z}_p\)-Kirchhoff graphs are explicitly constructed for \(\mathbb{Z}_p\)-valued matrices with an entry-wise nonzero vector in the row space. Finally, the authors also demonstrate that every binary matrix has a nonzero Kirchhoff graph, and they consider what this result means in the context of matroids.

Recommendations

• Matrices and their Kirchhoff graphs
• Matrices and Kirchhoff graphs, a rank-two, nullity-two construction
• Incidence, cut, and circuit matrices of a graph
• Uniform Kirchhoff graphs
• Vector-Space Methods and Kirchhoff Graphs for Reaction Networks

Cites work

• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Configurations from a graphical viewpoint
• Duality in geometric graphs: vector graphs, Kirchhoff graphs and Maxwell reciprocal figures
• scientific article; zbMATH DE number 50766 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Lectures on matroids
• Matrices and their Kirchhoff graphs
• Matroids and Graphs
• Topics in Matroid Theory
• Vector-Space Methods and Kirchhoff Graphs for Reaction Networks
• Vertex-transitive graphs

Cited in

(10)

• Uniform Kirchhoff graphs
• Equitable edge partitions and Kirchhoff graphs
• Paley-like graphs over finite fields from vector spaces
• Matrices and their Kirchhoff graphs
• scientific article; zbMATH DE number 3777426 (Why is no real title available?)
• Incidence, cut, and circuit matrices of a graph
• Matrix Representation of Finite Fields
• Matrices and Kirchhoff graphs, a rank-two, nullity-two construction
• Adjacency matrices over a finite prime field and their direct sum decompositions
• Prime, composite and fundamental Kirchhoff graphs

This page was built for publication: Matrices over finite fields and their Kirchhoff graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747897)