Enumeration of words by their number of mistakes

✍ Scribed by Doron Zeilberger

• Book ID: 103057046
• Publisher: Elsevier Science
• Year: 1981
• Tongue: English
• Weight: 265 KB
• Volume: 34
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(81)90026-1

✦ Synopsis

Consider :tlI words in { 1, . . . , n). A fixed set 'of words is labeled as the set of "r&takes". A generatin!; function for the number of words with m,l's, . . . , m,n's and k mistakes i?, given.

This generalizes a result of Gessel who considered the case wh=cre all the mistazes are two-lettered. A similar result has been independently obkked by Goulden and Jackson.