Mathematics Colloquium
All talks

Thursday, April 10, 2008, 01:00PM, NAC 6/111
Ethan Akin (CCNY), Chaos: what it is and why it doesn't matter (except maybe it does)Learn about the mysteries of chaos. Laugh at Jurassic Park. Be amazed by the proof of Nietzsche's Theorem. Impress your friends.
This talk is, I hope, suitable for advanced undergraduates, philosophers and cranks of all kinds.
This talk will follow the annual Math Finals Award Lunch which will be in NAC 8/133 from 121. Come and eat your fill, and then nap  quietly, no snoring, please, during the talk.

Thursday, November 15, 2007, 01:00PM, NAC 1/511E (Artino Lab)
Linda Cummings (Nottingham), Complex variable methods applied to free boundary problemsComplex variable methods such as conformal mapping can be usefully applied to a variety of 2D free (and moving) boundary problems where the governing equation is Laplacian or biharmonic. We illustrate how exact timedependent solutions can be obtained for a classical problem from fluid mechanics: the HeleShaw free boundary problem. This problem, which arises from a very simple experimental setup, is mathematically equivalent to many physicallyrelevant situations.
After introducing the HeleShaw experimental setup and governing equations, the complex variable methods will be explained, and demonstrated by examples. Issues of solution breakdown (and how to prevent this mathematically) will be discussed. If time permits, application of similar methods to other physicallyrelevant free boundary problems will be outlined.

Thursday, November 08, 2007, 01:00PM, NAC 6/111
Eric Lyon (Queen's University Belfast), Signal Processing, Composition, and What You (Mathematicians) Can Do for Computer MusicI will present some audio signal processing methods I've developed, demonstrate their compositional applications, and discuss more generally how mathematical innovations can find their way into music.

Thursday, November 01, 2007, 01:00PM, NAC 6/111
Jose Burillo (CCNY), An introduction to amenabilityAmenability is a classic subject dating to the 1920s, and related to some striking classic mathematics, like the axiom of choice, and the BanachTarski Paradox. In the last 20 years, it has gathered increased interest in the subject of geometric group theory, due to its invariance by quasiisometry. In this talk, I will give an introduction to the subject and try to explain its interest for contemporary group theorists, together with examples and open problems.

Thursday, October 25, 2007, 01:00PM, ***Special Room*** NAC 1/511E (Artino Lab)
Jaime Gutierrez (University of Cantabria, Spain), Lattices in Algorithmic MathematicsOur world is not linear. Many phenomena, however, are often "linearized" because only then a reasonably wellworking mathematical machinery can describe the phenomena and produce meaningful forecasts.
Lattices are geometric objects that have been used to solve many problems in mathematics and computer science. Lattice reduction strategies or the so called LLLtechniques seem inherently linear. The general idea of this technique is to translate our non linear problem to finding a short vector in a lattice built from the nonlinear equation. Then, the socalled Shortest Vector Problem and Closest Vector Problem in lattices play a major role. In recent years, these techniques have been used repeatedly in algorithmic coding theory and cryptography.
In this talk I will investigate lattice reduction technique on some algebraic problems, namely
 to compute intermediate subfields,
 to study Cayley graphs: Groebner basis and LLLreduced basis
Upcoming and recent talks  Up