http://www.math.rutgers.edu/~zeilberg/EM08/projects.html
Last Update: Oct. 29, 2008.

Use the Matrix Tree Theorem to find sequences for the number of spanning trees
of infinite families of graphs. Try to conjecture expressions for them
or their generating functions (automatically of course!).
[Paul Raff]
Read Paul Raff's great
article.

Interface GouldenJackson with natural language (e.g. English), see how far it
predicts the actual behavior, by analysing texts that you can easily
download form the internet.
You may use the
List of English words,
in Maple format.
[Beth Kupin and Debbie Yuster]
Here is
Beth Kupin and Debbie
Yuster's awesome GouldenJackson page, that contains
their great Maple codes, and lots of examples, and their
article.
 Interface GouldenJakson with Dyck words.
[Andrew Baxter]

Investigate solid partitions [Brian Nakamura].
Here is
Brian Nakamura's Final Project.

Investigate 3D Young Tableaux [Emilie Hogan]
Here is
Emilie Hogan's Maple Package
and
Emilie Hogan's writeup
Experimental Math, Spring 2008 main page