-
From Philipp Hieronymi
31 plays 0The goal with the project is to study the Steenrod Algebra under p=3 and to identify and construct modules over the Steenrod Algebra which cannot be extended to the… -
From Philipp Hieronymi
37 plays 0The goal of this project is to create interactive Mathematica-based visualizations of interesting mathematical topics for use in instruction and outreach activities.… -
From Philipp Hieronymi
30 plays 0An edge-induced vertex coloring is a vertex coloring of a graph that is obtained from an edge coloring via some specific rule. In this project we assign non-empty… -
From Philipp Hieronymi
18 plays 0In this project, we proved that we can write any permutation in the form of product of (n-1,1)*(n-2,1)*(n-3,1)*...* (1,1)$ shuffles , and we are currently exploring… -
From Philipp Hieronymi
38 plays 0In this project, we studied the Firefighters on Graphs problem. Given a graph G, a fire breaks out at time t = 0. At every subsequent turn, certain vertices are… -
From Philipp Hieronymi
36 plays 0Given n strands, a braid is a sequence of crossings in which adjacent strands are passed over or under each other. The braid group, Bn, is the group of all braids on n… -
From Philipp Hieronymi
23 plays 0We study the ratio, in a finite graph, of the sizes of the largest matching in any pair of disjoint matchings with the maximum total number of edges and the largest… -
From Philipp Hieronymi
39 plays 0On a Maker-Breaker game there are two players, Maker and Breaker, where Maker wins if they create a specified structure and Breaker wins if they prevent Maker from… -
From Philipp Hieronymi
59 plays 0An automated theorem prover is a program that takes as input a statement and proves (or disproves) it. Theorem provers can be very useful: computers are reliable and… -
From Daria Chudnovsky
62 plays 0Presenters: Daria Chudnovsky, Carolyn Janick, Michael Yun, Andrew Chong, Ian Copple
Search for ""
Public, Restricted and Moderated
- Managers: