International Journal of Mathematics and Mathematical Sciences

International Journal of Mathematics and Mathematical Sciences / 2006 / Article

Open Access

Volume 2006 |Article ID 096327 | https://doi.org/10.1155/IJMMS/2006/96327

Theresa L. Friedman, Paul Klingsberg, "Combinatorial identities by way of Wilf's multigraph model", International Journal of Mathematics and Mathematical Sciences, vol. 2006, Article ID 096327, 10 pages, 2006. https://doi.org/10.1155/IJMMS/2006/96327

Combinatorial identities by way of Wilf's multigraph model

Received04 Feb 2005
Revised29 Oct 2006
Accepted09 Nov 2006
Published19 Dec 2006

Abstract

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.

References

  1. 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 | MathSciNet
  2. R. 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 | MathSciNet
  3. P. 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 | MathSciNet
  4. A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, Academic Press, New York, 2nd edition, 1978. View at: Google Scholar | Zentralblatt MATH | MathSciNet
  5. N. 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 Scholar
  6. R. 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 | MathSciNet
  7. H. 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

Copyright © 2006 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views82
Downloads372
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.