The Goulden-Jackson Cluster Method: Extensions, Applications and Implementations

Simple item page
dc.creatorNoonan, John
dc.creatorZeilberger, Doron
dc.date1998-06-08
dc.date.accessioned2026-07-07T05:24:57Z
dc.date.available2026-07-07T05:24:57Z
dc.descriptionThe powerful (and so far under-utilized) Goulden-Jackson Cluster method for finding the generating function for the number of words avoiding, as factors, the members of a prescribed set of `dirty words', is tutorialized and extended in various directions. The authors' Maple implementations, contained in several Maple packages available from this paper's website (http://www.math.temple.edu/~zeilberg/gj.html), are described and explained.
dc.descriptionPlain TeX, to appear in J. Difference Eq. and Appl
dc.identifierhttps://arxiv.org/abs/math/9806036
dc.identifierhttp://arxiv.org/abs/math/9806036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77011
dc.subjectCombinatorics
dc.titleThe Goulden-Jackson Cluster Method: Extensions, Applications and Implementations
dc.typetext

Files

Collections

arXiv