Past Projects

Fall 2023

Problem Solving. Instructors – Justin Haverlick, Robert (Chance) Moore.
See details here.
Introduction to Knot Theory. Instructor – Carolyn Engelhardt.
See details here.
A Survey of Network Science, Neural Networks and their Overlap. Instructor – Jeremy Kazimer.
See details here.

Spring 2023

Caratheodory’s definition of a measurable set (organised by Dakota Leonard).
Centrality in Congressional Voting Networks (organised by Jeremy Kazimer).
Problem Solving (organised by Justin Haverlick).
A Combinatorial Approach to Topology (organised by Seth Hovland).
Elliptic Curves and Applications to Cryptography (organised by Makenzie Cosgrove).

Fall 2022

Group Theory and the Rubik’s cube (organised by Abhishek K. Sharma).
Mathematical Quantum Theory (organised by Sayantan Sarkar).
Surfaces: Finite and Infinite (organised by Arya Vadnere).
Tensor Calculus and General Theory of Relativity (organised by Sayantan Sarkar).

Spring 2022

Caratheodory’s Definition of a Measurable Set (organised by Dakota Leonard).
Elliptic Curve Cryptography (organised by Makenzie Cosgrove).
Network Analysis for Real World Applications (organised by Bengier Ulgen Kilic).
Problem Solving Strategies (organised by Arya Vadnere).

Fall 2021

Trees, Networks and Algorithms (organised by Makenzie Cosgrove).
Set Theory (organised by Gregory Vinal).

Fall 2020

Trees, Networks and Algorithms (organised by Makenzie Cosgrove).
Set Theory (organised by Gregory Vinal).

Spring 2019

Distinguishing a Ball and a Donut, Mathematically (organised by Subhankar Dey).

Winter 2019

Distinguishing a Ball and a Donut, Mathematically (organised by Subhankar Dey).
Counting Labelled Trees (organised by Makenzie Cosgrove).

Fall 2019

Sieve Methods (organised by Biao Wang).
A comparative hands-on study of Euclidean and Hyperbolic Geometry (organised by Subhankar Dey).