The kernel of the adjacency matrix of a rectangular mesh
classification
🧮 math.CO
keywords
kernelrectangularadjacencyentriesequalintegermatrixmesh
read the original abstract
Given an m x n rectangular mesh, its adjacency matrix A, having only integer entries, may be interpreted as a map between vector spaces over an arbitrary field K. We describe the kernel of A: it is a direct sum of two natural subspaces whose dimensions are equal to $\lceil c/2 \rceil$ and $\lfloor c/2 \rfloor$, where c = gcd (m+1,n+1) - 1. We show that there are bases to both vector spaces, with entries equal to 0, 1 and -1. When K = Z/(2), the kernel elements of these subspaces are described by rectangular tilings of a special kind. As a corollary, we count the number of tilings of a rectangle of integer sides with a specified set of tiles.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.