University of Georgia
Department of Mathematics
Seminar Schedule
August 25 - August 29, 2003
All Seminars are held in Boyd Graduate Studies Bldg. unless
otherwise noted.
MONDAY, August 25, 2003
Numerical Analysis
1:30p.m., Room 524
Speaker: Ming-Jun Lai, University of Georgia
Title of talk: A phase field model for the mixture of two
imcompressible fluids
Abstract: We present a phase field model for the mixture of
two fluids consisting of a Navier-Stokes system coupled with a Cahn-Hilliard
equations through an extra stress and transport terms.
Geometry
1:30p.m., Room 410
Speaker: Jason Cantarella, University of Georgia
Title of talk: Introduction to Ricci Flow and the Geometrization
Conjecture
VIGRE Algebra Seminar
2:30-3:30pm, Room 410
Speaker: Brian Boe, University of Georgia
Title of talk: Classical Lie Algebras
Topology
2:30p.m., Room 323
Speaker: Gordana Matic, University of Georgia
Title of talk: VIGRE group in Contact Topology( what we did and
what we will try to do)
Faculty and Graduate Social
3:00pm, Room 409
Coffee, Cookies, Tea
Lie Theory
3:30p.m., Room 303
Speaker: Bill Graham, University of Georgia
Title of talk: Organizational Meeting
TUESDAY, August 26, 2003
VIGRE
2:00-3:15pm, Room 304
Speaker: Jason Cantarella, University of Georgia
Title of talk: The Shapes of Tight Knots
Abstract: Unlike the classical machine that is composed of
well-defined parts that interact according to well-understood rules (gears and
cogs), the sliding interaction of two ropes under tension is extraordinary and
interactive, with tension, topology, and the system providing the form which
finally results. --Louis H. Kauffman, Knots and Physics, 1992.
In this talk, we'll think about the shapes made by a rope tied in a knot and pulled tight. These shapes turn out to obey a natural "balancing criterion'' which leads to some surprising results. The talk will conclude with a discussion of the problems involving in numerical simulation of the tightening of knots, and a brief overview of some possible projects for this year's VIGRE group.
Analysis
3:30pm, Room 322
Speaker: Akos Magyar, University of Georgia
Title of talk: Organizational Meeting
WEDNESDAY, August 27, 2003
Group Representation & Cohomology
2:30p.m., Room 410
Speaker: Nadia Mazza, University of Georgia
Title of talk: Endo-permutation modules
Algebraic Geometry
2:30pm, Room 303
Speaker: Valery Alexeev, University of Georgia
Title of talk: Mirror symmetry for toric, flag and reductive
varieties, continued
Faculty and Graduate Social
3:00pm, Room 409
Coffee, Cookies, Tea
Number Theory
3:30pm, Room 304
Speaker: Dino Lorenzini, University of Georgia
Title of talk: Torsion points
THURSDAY, August 28, 2003
Student Number Theory
3:30p.m., Room 322
Speaker: Eric Pine, University of Georgia
Title of talk: Why algebraic number theory is worth studying
Abstract: I'll discuss two problems, a diophantine equation
and improving the sieve of Eratosthenes, and use these to illustrate the need
for, or at the very least the usefulness of, algebraic number theory. As I am
a die-hard student of analytic number theory, this talk will not require any
prior knowledge of the language of algebraic number theory, so should be accessible
to all graduate students.
VIGRE Quantum Mechanics Seminar
2:00p.m., Room 303
Speaker: Cal Burgoyne, University of Georgia
TItle of talk: Solutions to the one dimensional eigenvalue
problem for a finite square potential.
A quantum particle in a box.
FRIDAY, August 29, 2003
Wavelet Analysis
2:30p.m., Room 524
Speaker: Ming-Jun Lai, University of Georgia
Title of talk: Box Spline Theory for Wavelet Analysis
Abstract: In this seminar, we will introduce box spline functions
and their basic properties. We shall discuss how to
construct box spline wavelets and prewavelets in Sobolev spaces.
CATS
1:25p.m., Room 306
Speaker: Robert W. Robinson, Faculty member, UGA Computer
Science Dept.
Title of talk: Counting Labeled General Cubic Graphs*
Abstract: Let g_i(n,d,l) denote the number of i-connected
labeled cubic graphs of order 2n having exactly d double edges, l loops and
no triple edge. For i = 0, 1, and 2 recurrence relations are found for these
numbers by counting in two different
ways the result of removing an edge.
Solving the recurrence relations using Maple has brought into focus the effect
of certain choices on the time complexity of the computations.
Examination of the numbers themselves has suggested a number of facts and conjectures about them.
A cubic graph is one which is 3-regular. A general graph allows loops and multiple edges. After a brief overview of the methods which lead to the recurrence relations, the talk will focus on the time complexity issues and some of the facts and conjectures.
* This is joint work with G.-B. Chae and E. M. Palmer