%0 Journal Article
%T Tiling a Pyramidal Polycube with Dominoes
%A Olivier Bodini
%A Damien Jamet
%J Discrete Mathematics & Theoretical Computer Science
%D 2007
%I Discrete Mathematics & Theoretical Computer Science
%X The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generalizes in   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
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/671