Related papers: Smith Normal Forms of Graphical Hermite Simplices
In the standard Category of Graphs, the graphs allow only one edge to be incident to any two vertices, not necessarily distinct, and the graph morphisms must map edges to edges and vertices to vertices while preserving incidence. We refer…
For integers $0 \leq \ell \leq k_{r} \leq k_{c} \leq n$, we give a description for the Smith group of the incidence matrix with rows (columns) indexed by the size $k_r$ ($k_c$, respectively) subsets of an $n$-element set, where incidence…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode graphs, such as the adjacency matrix and the Laplacian matrix, used to define the shift operator. For shift matrices…
We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…
A number of network structural characteristics have recently been the subject of particularly intense research, including degree distributions, community structure, and various measures of vertex centrality, to mention only a few. Vertices…
Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…
Following [14], we compute the motivic cohomology ring of the Nisnevich classifying space of the unitary group associated to the standard split hermitian form of a quadratic extension. This provides us with subtle characteristic classes…
Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…
We give a characterization of the graphs with at most three trivial characteristic ideals. This implies the complete characterization of the regular graphs whose critical groups have at most three invariant factors equal to 1 and the…
We study lattice fermions from the viewpoint of spectral graph theory (SGT). We find that a fermion defined on a certain lattice is identified as a spectral graph. SGT helps us investigate the number of zero eigenvalues of lattice Dirac…
A mixed graph is obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph with the vertex set $ \{v_{1}, \ldots , v_{n}\} $, is the matrix $ H=[h_{ij}]_{n \times n} $, where $ h_{ij}=-h_{ji}=i $…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…
V. I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a simple normal form for a family of complex n-by-n matrices that smoothly depend on parameters with respect to similarity transformations that smoothly depend on the same…
Architected materials possessing physico-chemical properties adaptable to disparate environmental conditions embody a disruptive new domain of materials science. Fueled by advances in digital design and fabrication, materials shaped into…
We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our…
In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…
A smooth Hermitian surface $X$ is a projective surface isomorphic to the Fermat surface of degree $q+1$ in positive characteristic. We study incidence relations of the rational curves of degree $q+1$ contained in $X$, and show that such…
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show that several NP-hard zero forcing numbers are not…