Sciweavers

JCT
2008
96views more  JCT 2008»
13 years 11 months ago
Asymptotic enumeration of dense 0-1 matrices with specified line sums
Let s = (s1, s2, . . . , sm) and t = (t1, t2, . . . , tn) be vectors of non-negative integers with m i=1 si = n j=1 tj. Let B(s, t) be the number of m
E. Rodney Canfield, Catherine S. Greenhill, Brenda...
COMBINATORICS
2007
60views more  COMBINATORICS 2007»
13 years 11 months ago
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
Roger E. Behrend, Vincent A. Knight
COMBINATORICS
2006
90views more  COMBINATORICS 2006»
13 years 11 months ago
On the Number of Possible Row and Column Sums of 0, 1-Matrices
For n a positive integer, we show that the number of of 2n-tuples of integers that are the row and column sums of some n
Daniel Goldstein, Richard Stong
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 3 months ago
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables p...
Ivona Bezáková, Alistair Sinclair, D...