combinatorial identities by way of wilfs multigraph model组合恒等式的左前卫的多重图模型.pdfVIP

COMBINATORIAL IDENTITIES BY WAY OF WILF’S MULTIGRAPH MODEL THERESA L. FRIEDMAN AND PAUL KLINGSBERG Received 4 February 2005; Revised 29 October 2006; Accepted 9 November 2006 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 par- tition of these paths generates a number of known, but hitherto disparate, combinatorial identities. We include several examples. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1. Introduction We begin with a well-known pair of identities, one satisfied by each type of Stirling num- ber. For 1 ≤ t ≤ n, Stirling numbers of the first kind are defined combinatorially by n := The number of t-cycle permutations of [n]. (1.1) t For 1 ≤ t n, these numbers satisfy the identity n = u u ···u . (1.2) 1 2 n−t t 1≤u u ···u ≤n−1 1 2 n−t For example, 5 35 = = 1 ·2 + 1 ·3 + 1 ·4 + 2 ·3 + 2 ·4 + 3 ·4. (1.3) 3 For 1 ≤ t ≤ n, Stirling numbers of the second kind are defined by n := The number of t-block partitions of [n]. (1.4) t Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2006, Article ID 96327, Pages 1– 10 DOI 10.1155/IJMMS/2006/96327 2 Combinatorial identities b