{
  "id": "1212.4105",
  "version": "v1",
  "published": "2012-12-17T19:15:04.000Z",
  "updated": "2012-12-17T19:15:04.000Z",
  "title": "Automated Counting of Towers (À La Bordelaise) [Or: Footnote to p. 81 of the Flajolet-Sedgewick Chef-d'œvre]",
  "authors": [
    "Shalosh B. Ekhad",
    "Doron Zeilberger"
  ],
  "comment": "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"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-12-17T19:15:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "flajolet-sedgewick chef-d",
      "automated counting",
      "bordelaise",
      "brilliant idea",
      "jean betrema"
    ],
    "tags": [
      "research tool"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1212.4105E"
    }
  }
}