2012/12/17 by Shalosh B. Ekhad, Doron Zeilberger, Ekhad, Shalosh B. +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1212.4105
Accompanied by the Maple package TOWERS available from http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/migdal.html . That page also has many deep computer-generated theorem obtained from the package
arxiv created 2012/12/17 · arxiv updated 2012/12/18
The brilliant idea of Jean Betrema and Jean-Guy Penaud that proved the celebrated "three to the power n" theorem of Dominique Gouyou-Beauchamps and Xavier Viennot, counting towers of domino pieces is extended and used to enumerate much more general towers, where the pieces can be many i-mers.