[Mathreu] [Fwd: REU speaker Louis Shapiro - talk #2]

[Neil Calkin]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1



- -------- Original Message --------
Subject: 	REU speaker Louis Shapiro - talk #2
Date: 	Tue, 30 May 2006 11:40:00 -0400
From: 	Lynn Callahan <lcalla at CLEMSON.EDU>
Reply-To: 	Lynn Callahan <lcalla at CLEMSON.EDU>
To: 	COES_MS_FACULTY-L at CLEMSON.EDU



Path counting, the butterfly lemma, hills, runs,
and the Chung-Feller theorem

Louis Shapiro
Department of Mathematics
Howard University


Abstract

Here we will look at Dyck paths, ordered trees, and other Catalan
phenomenon. Using generating functions we can obtain many results, old
and new. A few open, but hopefully accessible problems will be explored
as well.

*_Suggested homework for before my talk.
_*A. Show that (1-z)^(-2) = 1 + 2z + 3z^2 + 4z^3 +
B. Find the 14 permutations of four letters that are possible using one
stack.
C. Draw the 14 Dyck paths from (0,0) to (8,0).
D. Connect B. with C.

REU speaker
Friday, June 2, 2006
2:30pm
M-101

*/Lynn






/******************************
/Lynn Callahan          lcalla at clemson.edu
Mathematical Sciences
O-103 Martin Hall
Clemson SC 29634-0975
(864)656-5240
656-5230 fax
/*****************************
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.3 (GNU/Linux)
Comment: Using GnuPG with Fedora - http://enigmail.mozdev.org

iD8DBQFEfaxm5ZugyZwDr00RAp2bAKC3JyNJKx1QoY/SdjqMzIsZLyhzrgCfWJTK
wEf5knq9Y9H/Fm2DTJw9+OU=
=YvQH
-----END PGP SIGNATURE-----