Kumar Jeev's Research
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Articles in PDF format, PowerPoint presentations, C++ code, and abstracts. Includes "Symbolic Stochastic Systems and the Matrix Tree Theorem," with Jean-Louis Lassez, in which an alternative proof for the Matrix Tree Chain theorem, proven by Tom Leighton and Rivest (MIT, 1980), is presented. It is one of the most reproved theorems in combinatorics. Inspired by Traski's theorem on quantifier elimination, we use just Gaussian elimination to re-prove this theorem.|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.