Related papers: Symmetric Matrices over F_2 and the Lights Out Pro…
Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…
The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
The distance matrix of a connected graph is defined as the matrix in which the entries are the pairwise distances between vertices. The distance spectrum of a graph is the set of eigenvalues of its distance matrix. A graph is said to be…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
In this paper we prove that a matrix property of nettedness (all 2x2 cells satisfy a recurrence) is preserved for powers of such a matrix, where the coefficients are all instances of the same sequence. Also, we find an n-dimensional analog…
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…
Graph-modification problems, where we modify a graph by adding or deleting vertices or edges or contracting edges to obtain a graph in a {\it simpler} class, is a well-studied optimization problem in all algorithmic paradigms including…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
The symmetric difference of two graphs $G_1,G_2$ on the same set of vertices $[n]=\{1,2, \ldots ,n\}$ is the graph on $[n]$ whose set of edges are all edges that belong to exactly one of the two graphs $G_1,G_2$. Let $H$ be a fixed graph…
We present a general framework connecting global symmetries to the relativistic $S$-matrix through the lens of quantum information theory. Analyzing the 2-to-2 scattering of particles of any helicity, we systematically characterize…
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
A square matrix $M$ represents a graph $\Gamma$ if its nonzero off-diagonal entries encode the adjacencies of $\Gamma$, subject to a fixed ordering of the vertices. Over the field of two elements, we investigate the distribution of ranks in…
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…