Olivier Bodini ; Damien Jamet - Tiling a Pyramidal Polycube with Dominoes

dmtcs:413 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 2 - https://doi.org/10.46298/dmtcs.413
Tiling a Pyramidal Polycube with DominoesArticle

Authors: Olivier Bodini ; Damien Jamet

    The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generalizes in R^n the concept of trapezoidal polyominoes. In the present paper, we prove that n-dimensional dominoes can tile a pyramidal polycube if and only if the latter is balanced, that is, if the number of white cubes is equal to the number of black ones for a chessboard-like coloration, generalizing the result of [BC92] when n=2.

    Volume: Vol. 9 no. 2
    Published on: January 1, 2007
    Imported on: March 26, 2015
    Keywords: polyomino,tiling,domino,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    Consultation statistics

    This page has been seen 545 times.
    This article's PDF has been downloaded 296 times.