Search for tag: "geometry"

IGL Spring 2020 - Interactive Visualizations with Mathematica

The goal of this project is to create interactive Mathematica-based visualizations of interesting mathematical topics for use in instruction and outreach activities. This semester we focused on…

From  Philipp Hieronymi on 05/5/2020 29 plays 0  

IGL Spring 2020 - Royal Colorings of Graphs

An 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 subsets of {1, 2,..., k} to the…

From  Philipp Hieronymi on 05/5/2020 9 plays 0  

IGL Spring 2020 - Higher-Shuffles Operads 2

In 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 how one can define an analogue…

From  Philipp Hieronymi on 05/5/2020 5 plays 0  

IGL Spring 2020 - Firefighters On Graphs

In 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 protected, and the fire spreads to…

From  Philipp Hieronymi on 05/5/2020 13 plays 0  

IGL Spring 2020 - Building a Computer by Braiding Colorful Knots

Given 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 strands. Given any group G, and…

From  Philipp Hieronymi on 05/5/2020 17 plays 0  

IGL Spring 2020: Pairs of disjoint matchings

We 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 possible matching.A trivial…

From  Philipp Hieronymi on 05/5/2020 9 plays 0  

IGL Spring 2020 - Game Theory with Arithmetic Progressions

On 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 winning indefinitely. A 3-AP is a…

From  Philipp Hieronymi on 05/5/2020 16 plays 0  

IGL Spring 2020 - Automatic Theorem Proving

An 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 fast, allowing us to explore…

From  Philipp Hieronymi on 05/5/2020 33 plays 0  

2017 Research Live! Finalist: Derek Jung - Seeing further or more clearly

On the shoulder of giants. We may see further…but do we see more clearly? Derek researches constrained motion in space aka sub-Riemannian manifold geometry. (Mathematics) #ResearchLIVE…

From  Annie Feldmeier Adams on 01/19/2018 0 plays 0