Monday, May 5
will speak on "Double Bubbles Minimize"
at 4:10-5pm in Science 145. There will be refreshments beforehand.
Abstract: Dr. Hass will be speaking about the mathematical models of soap films and bubbles, which are modeled by minimal surfaces and constant mean curvature surfaces respectively. Dr. Hass, with his collaborator Roger Schlafly, proved last year the "Double Bubble Conjecture" which answered a question that had been first asked 2000 years ago and had been studied by many great mathematicians throughout history. He will be speaking about some of the innovative techniques used in this important work and will have some computer graphics as well as soap bubbles to illustrate the ideas.
Above images on this page are copyrighted by The Geometry Center, University of Minnesota and are from the video "Not Knot", distributed by A.K. Peters, Wellesley, MA. Used with permission.
"On Stirling Numbers"
2:10-3pm in Science 141.
Abstract: Stirling numbers are very useful and interesting numbers that frequently occur in modern mathematical literature and applications. This talk gives a brief introduction to these numbers, explaining their applications to combinatorics as well as to summation problems. Also demonstrated are some of their basic properties and computational aspects.
"Real Estate in Hyperbolic Space: Investment Opportunities for the 90's"
2:30-3:20pm in Science 143.
Abstract:
Have you found the new investment climate a bit on the chilly side?
Nervous about stocks, bonds and mutual funds? Afraid of risky
investments in Euclidean space? Then real estate in hyperbolic
space is for you!
We will discuss the enormous potential of this new investment opportunity and describe the many fascinating properties of hyperbolic space that make it such an attractive place to live. This is the financial equivalent of the 1980's junk bond. Don't miss out! Bring your checkbook and credit references! No previous math or real estate background necessary!
2:30-3:20pm in Science 143. Tea and cookies will be served beforehand at 2pm in Peters 390.
Abstract and more information
"What Computers Can't Do: The Halting Problem"
2:30-3:20pm in Science 143.
Abstract: As computers become more and more powerful, the kinds of problems that they can solve become more impressive. Some problems may be solvable by computer, particularly if we are willing to wait a long, but finite, amount of time. A natural question is: "Is there any mathematical question that, in principle, an extremely powerful computer cannot solve?" In order to answer this question rigorously, a mathematical formalization of what a computer is is needed. Mathematical tools from the field of mathematical logic are then used to answer the question.
Tea and cookies will be served beforehand at 2pm in Peters 428.
" The Boolean Lattice Model of Communication Networks"
Abstract: Imagine a large network of computers (or telephones) where a message needs to be sent from a source node to a target node, but a certain number of intermediate nodes are unavailable (malfunctioning or busy). The field of Network Reliability is concerned with determining whether the network is capable of carrying out the task of information transmission. In this talk we answer two questions (one where independent nodes fail and one where chains of nodes break down) in the Boolean Lattice, a lattice often used for modeling communication networks. No previous knowledge of either Network Reliability or the Mathematics involved is assumed.
2:30-3:20pm in Science 143