For many families of combinatorial objects, a construction of Wilf (1977) allows the members of the family to be viewed as paths in a directed multigraph. Introducing a partition of these paths generates a number of known, but hitherto disparate, combinatorial identities. We include several examples.
E. Calabi and H. S. Wilf, “On the sequential and random selection of subspaces over a finite field,” Journal of Combinatorial Theory. Series A, vol. 22, no. 1, pp. 107–109, 1977.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetR. J. Clarke and M. Sved, “Derangement types,” Bulletin of the Institute of Combinatorics and Its Applications, vol. 3, pp. 21–30, 1991.
View at: Google Scholar | Zentralblatt MATH | MathSciNetP. Klingsberg, “A combinatorial family of labeled trees,” Journal of Algorithms, vol. 1, no. 1, pp. 104–106, 1980.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetA. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, Academic Press, New York, 2nd edition, 1978.
View at: Google Scholar | Zentralblatt MATH | MathSciNetN. J. A. Sloane, Ed., The on-Line Encyclopedia of Integer Sequences, N. J. A. Sloane, Ed., retrieved July 2006, from AT &T Labs-Research. http://www.research.att.com/~njas/sequences/.
View at: Google ScholarR. P. Stanley, Enumerative Combinatorics. Volume I., The Wadsworth & Brooks/Cole Mathematics Series, Wadsworth & Brooks/Cole Advanced Books & Software, California, 1986.
View at: Google Scholar | Zentralblatt MATH | MathSciNetH. S. Wilf, “A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects,” Advances in Mathematics, vol. 24, no. 3, pp. 281–291, 1977.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet