Codeterminantal graphs (Q2154283)

Determinantal ideals are a central topic in both commutative algebra and algebraic geometry, and they also have numerous connections with invariant theory, representation theory, and combinatorics. In this article, authors explore their connections with algebraic combinatorics. In particular, they investigate their relationships with the spectrum and the Smith normal form (SNF). Even though there is no direct connection between the SNF and the spectrum, certain attempts were made to relate the spectrum and SNF of matrices associated to graphs. In particular \textit{J. J. Rushanan} [Linear Algebra Appl. 216, 177--184 (1995; Zbl 0823.15010)] studied the SNF and spectrum of non-singular matrices with integer entries and established divisibility relations between the largest invariant factor sn and the product of all eigenvalues. \textit{M. Newman} and \textit{R. C. Thompson} [Linear Algebra Appl. 145, 1--20 (1991; Zbl 0731.15011)] studied the relationship between eigenvalues and invariant factors of matrices over rings of algebraic integers. The connection between the eigenvalues and the SNF has also been studied by Kirkland for integer matrices with integer eigenvalues arising from the Laplacian of graphs, and by Lorenzini for Laplacian matrices of rank \(n-1\). On the other hand, \textit{M. Elsheikh} and \textit{M. Giesbrecht} [Linear Algebra Appl. 481, 330--349 (2015; Zbl 1317.15010)] established some conditions under which the \(p\)-adic valuations of the invariant factors of an integer matrix are equal to the \(p\)-adic valuations of the eigenvalues. Recently, a presentation enumerating the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (cospectral mate), or at least one other graph with the same Smith normal form (coinvariant mate) with respect to several matrices associated to a graph. Determinantal ideals of graphs are the ideals generated by the \(k\)-minors of matrices whose entries are in a polynomial ring. In this paper, the authors extend a result by Rushanan [loc. cit.] that states that any eigenvalue of a diagonalizable matrix divides the last invariant factor of its SNF. In fact, they prove that an eigenvalue divides the \(k\)-th invariant factor of its SNF if the eigenvalue belongs to a variety of the \(k\)-th univariate integer determinantal ideal of the matrix. Furthermore, they investigate graphs having the same determinantal ideals with at most one indeterminate under different (polynomial) rings, the so called codeterminantal graphs, which generalize the concepts of cospectral and coinvariant graphs. In this connection, they also obtain a necessary and sufficient condition for graphs to be codeterminantal on \(R[x]\), and characterized when codeterminantal graphs are cospectral and coinvariant, respectively.