arXiv Analytics

Sign in

arXiv:1212.4105 [math.CO]AbstractReferencesReviewsResources

Automated Counting of Towers (À La Bordelaise) [Or: Footnote to p. 81 of the Flajolet-Sedgewick Chef-d'œvre]

Shalosh B. Ekhad, Doron Zeilberger

Published 2012-12-17Version 1

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.

Comments: 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
Categories: math.CO
Related articles:
arXiv:math/9801016 [math.CO] (Published 1998-01-06)
Automated counting of LEGO towers
arXiv:2010.02389 [math.CO] (Published 2020-10-05)
Automated Counting of Restricted Motzkin Paths
arXiv:2201.07326 [math.CO] (Published 2022-01-18)
Automated Counting and Statistical Analysis of Labeled Trees with Degree Restrictions

Links

Toolbox