arXiv:math/0201211 [math.CO]AbstractReferencesReviewsResources
The kernel of the adjacency matrix of a rectangular mesh
Published 2002-01-22Version 1
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.
Comments: 15 pages, 17 figures
Categories: math.CO
Related articles: Most relevant | Search more
The triangle-free graphs with rank 6
arXiv:math/0109043 [math.CO] (Published 2001-09-06)
A special tiling of the rectangle
Arithmetic properties of the adjacency matrix of quadriculated disks