Speaker: Doron Zeilberger, Rutgers
Title: A Case Study in Experimental (Yet Fully Rigorous!) Mathematics: The
Asymptotic Independence of the Two Main Permutation Statistics
Abstract: I will describe the computer-assisted proof, by my student
Andrew Baxter and myself, of the intriguing fact that the two
most important permutation statistics, namely the number of
inversions and the major index are asymptotically independent
(all the terms will be explained, the talk does not assume any
previous knowledge of combinatorics or probability). At the same time, I will debunk several common prejudices of
many mathematicians: "computers can's prove, they can only
compute", "you can't generalize from finitely many cases", and
"a math article has to be boring in order to be correct". I will
also suggest a more effective, and much more reliable, way for
future scholarly communication, rather than the current
"peer"-reviewed system, that uses anonymous referees.
this man is crazy...i love him
lilwayne93525 7 months ago