The kernel of the adjacency matrix of a rectangular mesh (Q1849448)

Given an \(m \times 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.\) The authors prove that the kernel of \(A\) is a direct sum of two natural subspaces whose dimensions are equal to \(\lceil c/2 \rceil\) and \(\lfloor c/2 \rfloor\) where \(c = \text{gcd} (m + 1, n + 1 - 1).\) They show that there are bases to both vector spaces, with entries equal to \(0, 1\) or \(-1.\) When \(K = \mathbb{Z}/(2),\) the kernel elements of these subspaces are described by rectangular tilings of a special kind. As a corollary, the authors count the number of tilings of a rectangle of integer sides with a specified set of tiles.