A special tiling of the rectangle
classification
🧮 math.CO
keywords
rectanglespecialadjacencycountfrongraphintegerkernel
read the original abstract
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
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.