Part I (formerly Project 1)
Using the preliminary Maple package (that you should expand) DZtools.txt, try to get as many sequences as possible for enumerating the number of lattice walks from the origin to [n,...,n] using a symmetric set of steps. Find which ones are already in the OEIS, and for new ones, enter at least some of them to the OEIS.
Also (for the OEIS) find the asymptotic expressions for the sequences using procedures Asy and/or AsyC in the Maple package
AsyRec.txt
(type ezra(Asy) and ezra(AsyC) for instructions)
Part II (formerly the original project 2)
Using the preliminary Maple package (that you should expand) DZtools.txt, try to get as many sequences as possible for enumerating the number of lattice walks from the origin back to the origin in n steps using a symmetric set of steps and their reverses. Find which ones are already in the OEIS, and for new ones, enter at least some of them to the OEIS.
Also (for the OEIS) find the asymptotic expressions for the sequences using procedures Asy and/or AsyC in the Maple package
AsyRec.txt
(type ezra(Asy) and ezra(AsyC) for instructions)
Project Leader: Caroline Cote
Other team member: Guy Adami
9:35-9:50 am
writeup (and slides) Maple code
Study the Statistics of Standard Young tableau using the Greene-Nijenhuis-Wilf amazing algorithm (to be covered in class soon). Incorporate methods from statistics, including Bradley Efron's Bootstrap method
Project Leader: Aurora Hiveley
Other team member: Lucy Martinez
9:55-10:10 am
Experiment with the Robinson-Schenstead algorithm, combining it with the Bootstrap method to find statistical properties of permutations reflected by the RS algorithm.
Project Leader: Austin DeCicco
Other team members:Jike Liu
10:15-10:30 am
writeup Maple code slides dataset
Experiment with generalizations of Conway's John Conway's Subprime Fibonacci sequences.
Project Leader Abrar Almahmeed
Other team member: Pablo Blanco
10:35-10:50 am
Watch the presentations (kindly produced by Aurora Hiveley)