This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MAT 280 UC Davis, Winter 2011 Longest increasing subsequences and combinatorial probability Homework Set 3 Homework due: Wednesday 3/16/11 1. Prove the summation identity n X k =0 ( 1) k k + n k = n ! ( + 1) ... ( + n ) ( n 0) , which was used in the proof of the Bessel function identity (2.40) in the lecture notes. Hint: First prove, and then use, the following binomial inversion principle: if ( a n ) n and ( b n ) n are sequences such that a n = n k =0 ( 1) k ( n k ) b k for all n , then the symmetric equation b n = n k =0 ( 1) k ( n k ) a k also holds for all n . 2. Prove Hadamards inequality from elementary linear algebra: if A is an n n matrix whose column vectors are v 1 ,...,v n R n , then  det( A )  n Y j =1  v j  2 . What is the geometric meaning of this inequality? 3. Let be a countable set. Let M : R be a kernel which is symmetric (i.e., M ( x,y ) = M ( y,x ) for all x,y ) and positivedefinite (i.e., if we think) and positivedefinite (i....
View
Full
Document
 Winter '08
 Hunter
 Applied Mathematics, Probability

Click to edit the document details