http://www.math.rutgers.edu/~zeilberg/EM11/SugestedProjects.html
First posted: March 27, 2011
Last Update: May 11, 2011
First draft due May 10, 2011, 11:59:59pm .
Feel free to propose your own project!
As long as it uses Maple (or even Mathematica) in a nontrivial way it is fine.
It does not have to do anything with Boolean Circuits, or flipping pancakes.
NOTE: Any project can be done by n people, with 1 ≤ n ≤ 2 .
Untaken Projects

Develop and implement algorithms for proving SAT using PIE, largely expanding
PIE.txt

Generalize Pancakeflipping, by changing the rules, and develop algorithms for sorting, using these rules.

Look up formal languages and grammars, and develop a Maple package, following your favorite book.

Write Maple implementations of all the statmenets in
the classic
AlonBopanna article

Implement, and if possible, improve, the
5n lower bound
in the article by Kazuo Iwama and Hiroki Morizumi.

Write Maple implemenations of the beautiful work of
Philippe FLAJOLET(19482011) on
continued fractions
Taken Projects

Investigate antichains in the Boolean Lattice.
[Suggested and claimed by Jacob Baron, see his
project description]

Completely automate, and generalize, the GatesPapadimitriou pancakefliping algorithm.
(Claimed by Matthew Russel and Tim Naumovitz)

David
Wilson's
class project
to create a general framework for testing theorems empirically
in Arithmetic Combinatorics  Roth's Theorem, Szemeredi's Thoerem, Van der
Waerden's Theorem, Folkman's Theorem and so on.
(first posted March 28, 2011, in progress).

Write Maple implementations of all the statmenets in
the classic
AlonBopanna article
(claimed by Emily Sergel).
Added May 11, 2011:
Here is
Emily Sergel's project.

Investigate about elliptic curves.
NagellLutz's theorem.
[Suggested and claimed by Taylor Burmeister].

Develop a package to work with Coxeter Groups
[Suggested and claimed by Matthew Samuel].

Turning Boolean satisifiability problems into logic puzzles,
and exploring the structure of
what Raymond Smullyan calls "metapuzzles", where one of the pieces of
information is about the solvability of the puzzle.
[Suggested and claimed by Susan Durst].

Investigate
goemetric perfect matchings
[suggested and claimed by Justin Gilmer]

Investigate
slicing planes
[suggested and claimed by Simao Hernande]
Experimental Math, Spring 2011 main page