| Presenter: |
Keith Promislow, Michigan State University |
| Date: |
Wednesday, September 15, 2010 |
| Time: |
1:00 p.m. |
| Location: |
Mackinac Hall, Room: A2-165 |
| Title: |
Energy Methods for Energy Conversion |
| Abstract: |
Efficient energy conversion is a fundamental problem of the 21
century.
A key step in converting photonic and chemical energy to useful electric
potential is the generation of electrostatic double layers at catalyst
interfaces.
To do so efficiently requires interpercolating structures with
nanoscale morphology,
which are often generated by phase-separation of functionalized
polymer-solvent mixtures.
We will present an overview of energy methods which guide phase
separation, and
introduce a novel class of energies which incorporate electrostatic
and solvation effects
via higher order curvatures that drive interfacial generation.
|
| |
|
| Presenter: |
Daniel Durusoy, GVSU |
| Date: |
Monday, September 27, 2010 |
| Time: |
1:00 p.m. |
| Location: |
Mackinac Hall, Room: A2-165 |
| Title: |
Tightness and examples from planar contact structures |
| Abstract: |
After an introduction to plane fields and contact structures, we will see a concrete example of an overtwisted disk (obstruction to tightness), how to encode a contact structure via twists on a surface, and go through part of the process of distinguishing which structures are tight by counting special regions in a planar graph related to the given contact structure. (This is a joint work with Firat Arikan.)
|
| |
|
| Presenter: |
Darren Parker, GVSU |
| Date: |
Wednesday, October 20, 2010 |
| Time: |
1:00 p.m. |
| Location: |
Mackinac Hall, Room: A2-165 |
| Title: |
Convexity and Independence in Directed Graphs |
| Abstract: |
In geometry, the definition of a convex set depends completely on points and lines (i.e. between any two points in the set, the resulting line is also in the set). One way to generalize this to other contexts is to look for structures that include something that corresponds to points and something that corresponds to lines. Directed graphs are a perfect environment in which to work with convexity. Here the "points" are the vertices, and the "lines" are directed paths. In this talk, I will discuss some work I have done with Randy Westhoff and Marty Wolf of Bemidji State University on convexity in multipartite tournaments.
|
| |
|
| Presenter: |
Firas Hindeleh, GVSU |
| Date: |
Wednesday, November 10, 2010 |
| Time: |
1:00 p.m. |
| Location: |
Mackinac Hall, Room: A2-165 |
| Title: |
Part 1: Using Bluetooth to Engage Students Part 2: Killing's equations for invariant metrics on Lie groups
|
| Abstract: |
Part 1: Engaging students in discussion result in better comprehension of the material and overall enhance learning. I will show how peer instruction with the use of Bluetooth technology (BT) promotes students' participation and comprehension.
Part 2: We will consider Lie groups in dimension two and three and will focus on the solutions of Killing's equations. A striking result is that several of the three-dimensional Lie groups turn out to be spaces of constant curvature.
|
| |
|
| Presenter: |
Teresita Ramirez-Rosas, GVSU |
| Date: |
Thursday, November 18, 2010 |
| Time: |
1:00 p.m. |
| Location: |
Mackinac Hall, Room: B2-124
|
| Title: |
Counting Trisecants
|
| Abstract: |
In the last two talks, I discussed the set of secants and trisecants of a polygonal knot K in general position. Recall that a triple abc is a trisecant of K if a, b and c are points in K, no two of which lie on a common edge of K, that are collinear, in this order, in R^3. Fix a point x in K and let t_{x} denote the number of trisecants having x as a common point. One of the goals of my current research is to be able to find a lower bound for t_{x} in terms of the crossing number, cr(K), for the knot K. I have conjectured that t_{x} >= cr(K). In this talk, I will present the ideas that I have been using in order to prove this conjecture.
|
| |
|
| Presenters: |
Reynaldo Herrera, Bryan Kimball &
David Ridder, GVSU; Faculty Advisors: Ed Aboufadel &
Brian Drake, GVSU |
| Date: |
Wednesday, December 1, 2010 |
| Time: |
1:00 p.m. |
| Location: |
Mackinac Hall, Room: A2-165 |
| Title: |
Senior thesis presentations
|
| Abstract: |
Students: Reynaldo Herrera and Bryan Kimball
Topics: Counting Tilings (Reynaldo Herrera) and Rankings in Digraphs (Bryan Kimball) [Math 496 class projects]
Faculty Advisor: Brian Drake
Student: David Ridder
Topic: Geometric Cryptography [Math 399 project]
Faculty Advisor: Ed Aboufadel
|
| |
|