An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences


Certain enumeration problems may be expressed in terms of sequences possessing a specified number of subsequences which are elements of a prescribed set of distinguished sequences. We obtain an inversion theorem which expresses the required generating function in terms of one connected with the set of overlapping distinguished sequences called clusters… (More)



Citations per Year

60 Citations

Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics