E. Rodney Canfield

activity

20062009

most citedAsymptotic enumeration of integer matrices with constant row and column sums

9 citations · 11 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2009★ 1 cited

The Mahonian probability distribution on words is asymptotically normal

E. Rodney Canfield, Svante Janson, Doron Zeilberger

The Mahonian statistic is the number of inversions in a permutation of a multiset with $a_{i}$ elements of type $i$ , $1 \leq i \leq m$ . The counting function for this statistic is the $q…

math.CO2007★ 9 cited

Asymptotic enumeration of integer matrices with constant row and column sums

E. Rodney Canfield, Brendan D. McKay

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalen…

math.CO2006★ 1 cited

Counting permutations by their runs up and down

E. Rodney Canfield, Herbert S. Wilf

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.