Automated Counting of Towers (\`A La Bordelaise) [Or: Footnote to p. 81 of the Flajolet-Sedgewick Chef-d'{oe}vre]
classification
🧮 math.CO
keywords
towerscountingpiecesautomatedbetremabordelaisebrilliantcelebrated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.