This file can be used to add scheduled events to your calendar, however every program is unique. Below you will find what information is available, but if nothing else works try creating a new calendar in your program and using
http://math.colorado.edu/seminars/ics/slow.ics
as the source.
Thunderbird
The Graduate Student Seminar (GSS) is an opportunity for grad students to give general interest talks to an audience of other grad students in a low-pressure environment. GSS talks are typically 50 minutes long and accessible to a general mathematical audience. We encourage everybody to give a talk! Some ideas include existing talks from undergrad research, REUs, or a Masters program, practice for upcoming conference talks, educational talks about material you've been studying for your comprehensive exam, or just presentations on a recreational mathematical topic you know a lot about.
For inquiries, contact Nicholas Christoffersen or sign up directly with this form
The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a finite graph. In the general case, the problem is -hard. However, there is a subcollection of graph classes for which there exists an efficient solution. I will display my method which provides algorithms that are proven correct by their underlying algebraic operations unlike existing purely algorithmic solutions to this problem. We introduce a `booleanize' mapping on the adjacency matrix of a graph which we prove identifies the solution for Trees, Uniform Block Graphs, Block Graphs, and Directed Acyclic Graphs with exact conditions and associated polynomial-time algorithms. I will then show an algebraic construction with elements as graphs and two operations that have further underlying structure within them. Then, showcasing some results and theorems that exist behind the hidden structure of this algebraic construction.
Modular forms are functions on the upper half plane which satisfy certain transformation laws given by the action of certain arithmetic groups. Though often introduced as a complex analytic object, modular forms have a tendency to appear in seemingly unrelated areas of mathematics. How many ways can an integer be written as a sum of four squares? Modular forms can be used to solve this. What is the densest arrangement of non-overlapping spheres in ? Modular forms can be used to solve this. The coefficients of the Fourier expansion of some important modular function encode the dimensions of the irreducible representations of the monster group (moonshine!!!). In the context of geometry, modular forms give pluricanonical forms on some moduli space. The goal of this talk is to introduce modular forms, marvel at some of their interesting properties, and then explain why I care about modular forms as an algebraic geometer.
An Algebra of Graphs and the Longest Path Problem