Howard Rumsey

Learn More
An alternating sign matrix is a square matrix such that (i) all entries are 1, -1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225)(More)
P(0 IO) = P(1 1 1) = 9. Therefore, although Capon apparently did not realize it, the saving in bits predicted by his model is actually a lower bound for any two-level source with average white run length l/ (1 P(l 1 1)) and average black run length l/(1 P(0 IO)), because the run lengths in Capon’s model are independent, and the exponential distributions of(More)