id: 05298096
dt: j
an: 2008d.00394
au: Petkošek, Marko; Pisanski, Tomaž
ti: Combinatorial interpretation of unsigned Stirling and Lah numbers.
so: Pi Mu Epsilon J. 12, No. 7, 417-424 (2007).
py: 2007
pu: Worcester Polytechnic Institute (WPI), Mathematical Sciences, Worcester, MA
la: EN
cc: K20
ut: combinatorics; discrete mathematics; partitions; permutations; cycles;
queues; recursion; polynomial identities; matrix representations;
signed integers; proving
ci:
li:
ab: From the introduction: In this paper we examine three families of numbers
with interesting combinatorial interpretations. We use three basic
combinatorial proof techniques: the bijective proof, the rule of
summation, and the method of distinguished element.
rv: