Asymptotic enumeration of integer matrices with constant row and column sums

Details Asymptotic enumeration of integer matrices with constant row and column sums Asymptotic enumeration of integer matrices with constant row and column sums

2007-03-20

arxiv.org/abs/math/0703600v2

Mathematics

Combinatorics

25 pages. This is a revised edition of 'Asymptotic enumeration of contingency tables with constant margins' submitted in March

Scientific paper

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. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x n such that the row marginal sums are all s and the column marginal sums are all t. A third equivalent description is that M(m,s;n,t) is the number of semiregular labelled bipartite multigraphs with m vertices of degree s and n vertices of degree t. When m=n and s=t such matrices are also referred to as n x n magic squares with line sums equal to t. We prove a precise asymptotic formula for M(m,s;n,t) which is valid over a range of (m,s;n,t) in which m,n become infinite while remaining approximately equal and the average entry is not too small. This range includes the case where m/n, n/m, s/n and t/m are bounded from below.

Affiliated with

Also associated with

No associations

Rating

Asymptotic enumeration of integer matrices with constant row and column sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic enumeration of integer matrices with constant row and column sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic enumeration of integer matrices with constant row and column sums will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-123553