|
|
The Summer School will consist of eight 28 hour courses run over four weeks.
Course Selection
In your application form you will be asked to select at least two of these courses,
giving at least two back-up choices.
| Course: |
Knots and Links |
| Lecturer: |
Iain Aitchison |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
A (mathematical) classical knot is essentially just a circle embedded in 3-dimensional space: take an extension cord, tie it in a knot, and plug the two ends together. If you can lay this down on a plane so that it looks like a standard circle, we say the knot is `unkotted', or the `unknot'. `Clearly' there are many examples which are not the unknot:
The major problem is to make these notions precise enough to be able to prove this, and to classify what possibilities can occur. A link is a collection of non-intersecting knots (that is, take several extension cords, entangle them some how and plug ends together).
Knots and links play a variety of roles in human culture, and, from a mathematical point of view, similarly display surprising and deep interconnections with other branches of mathematics and physics.
We will describe some of the combinatorial properties of planar diagrams of knots and links, and ways of determining whether or not
two diagrams represent the same link in 3-dimensional space. Many of these techniques are purely algebraic, while others involve notions of 2- and 3-dimensional locally Euclidean spaces (manifolds). In fact, knots and links can be used to represent all possible compact 3- and 4-dimensional manifolds, making contact with research in relativity theory and elementary particle physics. Some of the algebraic structures we will explore have their origins in Lie algebras and representation theory, but familiarity with these notions are not required.
The first part of the course will focus on knots and links as combinatorial objects, and will describe some of the invariants such as the Alexander polynomial, fundamental group, the Seifert form, linking numbers, and the more recent Jones polynomial, Kauffman bracket, Vassiliev invariants and related generalizations.
We then consider the role of knots and links in describing 3-dimensional manifolds, also making (peripheral) contact with with some of the topology and geometry involved in Thurston's Geometrization Conjecture.
If anyone is interested in having Iain `assist with their inquiries': email me at iain at ms.unimelb.edu.au
|
| Prerequisites: |
Some familiarity with: basic topological concepts of open and closed sets, continuity, compactness, countability;
and basic algebraic concepts of rings, modules, and group theory. A sense of fun doing seemingly innocent mathematics is also desirable!
|
| Assessment: |
Assignment problems 40%, take-home exam 60%. |
| Resources: |
Some lecture notes will be provided.
There are several books on knot theory worth perusing, some at a more basic level than this course *, and some more sophisticated ***.
*C Adams, Why Knot?: An Introduction to the Mathematical Theory of Knots (basic)
*/**C Adams, The Knot Book. (less basic)
**H Burde and H Zieschang, Knots. (classical)
**RH Crowell and RH Fox, Introduction to knot theory. (classical)
K Reidemeister, Knot Theory. (classical)
**Dale Rolfsen, Knots and links. (classical)
**L Kauffman, Knots and physics.
*/**C Livingston, Knot theory.
**/***VO Manturov, Knot Theory.
**/***VV Prasolov and AB Sossinsky, Knots, links, braids and 3-manifolds.
**/***WBR Lickorish, An introduction to knot theory. (appropriate, deeper)
***W Menasco, Handbook of Knot Theory. (deeper)
(20 min Movie) Not knot. Directed by Charlie Gunn and Delle Maxwell. (great fun! - loved by `Grateful Dead' fans)
|
|
Return to Top
|
| Course: |
Advanced Methods for Ordinary Differential Equations |
| Lecturer: |
Andrew Bassom |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
Ordinary differential equations arise in numerous
applications. In elementary courses we learn how to solve
several types of problem (various first order equations,
constant coefficient second order equations) but soon realise that,
unfortunately, not all equations admit simple
closed solutions. Such equations are sometimes only amenable to
computational solution, but frequently, especially in problems
arising in fluid or solid mechanics, a small parameter is present
that permits an approximate solution to be found. In the first part
of the course we shall develop various techniques for solving some of these
problems.
The second set of lectures will be devoted to a discussion of
qualitative analysis of differential equations. Here the focus will be
on problems when not even approximate solutions can be derived: rather
we can analyse the equations and thereby deduce how solutions must behave.
If time we will discuss equations with particular properties: for example
equations with periodic coefficients or problems that can lead onto chaos.
Major topics might include
Asymptotic sequences and series
The WKB method. Transition points.
Singular perturbation problems.
Multiscaling and the method of strained co-ordinates.
Stability and subharmonic resonance.
Phase-planes, indices and the Poincare-Bendixson theorem
Differential equations with periodic coefficients.
Chaotic systems
|
| Prerequisites: |
Knowledge of elementary differential equations would be
very useful!
|
| Assessment: |
To be decided: but expected to be about 40% problem sheet and
60% final exam. |
| Resources: |
C.M. Bender & S.A. Orszag: Advanced Mathematical Methods for Scientists and
Engineers. McGrawHill (1978)
M. Braun: Differential equations and their applications; an introduction to
applied mathematics. Springer (1983)
|
|
Return to Top
|
| Course: |
Martingales in Discrete Time |
| Lecturer: |
Kais Hamza |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
Martingales have been at the core of the theory of probability for more than fifty years. Nowadays, martingales are used in biology, engineering, finance, economics and physics, to name only a few.
This course is an introduction to the theory of martingales in discrete time. While martingales in continuous time are often the tool of choice in contemporary probability theory, a deep understanding of this fascinating theory cannot occur without a thorough investigation of the discrete time counterpart.
The course will start with a review of basic measure-theoretical concepts followed by a brief account of independence, product measures, expectations and conditioning. Martingales (in discrete time) will then be introduced and their main properties studied. Some of the main topics covered include the Optional Stopping Theorem, Doob's Convergence Theorem, Doob's decomposition of submartingales and Doob's inequalities. Applications to branching processes, random walks and discrete time finance will also be presented.
|
| Prerequisites: |
Some probability at 3rd year level.
|
| Assessment: |
Assignments 30% and
final exam 70%.
|
| Resources: |
D. Williams, Probability with Martingales, Cambridge Univ. Press, 1991.
J. Neveu, Discrete-Parameter Martingales. New York: Elsevier, 1975.
|
|
Return to Top
|
| Course: |
Approximation Theory |
| Lecturer: |
Markus Hegland. Feel free to e-mail Dr Hegland if you have any questions by clicking here. |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
Approximation (of functions) is a core component of most computational techniques. It forms a bridge between pure mathematics (analysis)
and computation. It is based on rigorous mathematics and provides the
means to compute the solution of differential equations, for example.
We approximate with polynomials, splines and wavelets. Approximation
theory provides the framework for a unified discussion using a large
variety of different function classes. In the first part of the lectures
we cover "classical approximation theory", a topic which was more or
less completed by 1980. Many textbooks exist which cover the classical
theory which includes results on polynomials like the Weierstrass
theorem, but also rational approximation and approximation with splines or
piecewise polynomials. One of the core questions of classical approximation
theory is how well we can approximate, i.e., the question of "best approximation". This has been investigated for a variety of norms, we will
consider mainly uniform approximation using the supremum norm and least squares using the Euclidean norm. The course will include a
discussion of Jackson and Bernstein theorems which leads to modern
approximation theory including adaptive approximation and wavelets, and
multi- and high-dimensional approximation. At the end we will discuss
tensor-product based approximations in high dimensions including sparse
grids.
|
| Prerequisites: |
A typical 3rd year mathematics student should be able to follow the course.
We need some results from Analysis I&II including continuous functions, differentiation and integration, compactness and norms in function spaces. In addition we will make use of the concept of orthogonality which is covered in a
linear algebra course. Helpful but not necessary is some familiarity with
functional analysis, Fourier series, convexity and (some) complex analysis. If you
are interested in a "hands-on" approach, you should know something about
computers and programming.
|
| Assessment: |
We plan to have several exercises to get practical familiarity with both
the mathematical tools but plan also to do some computations using the
Python programming language with Numpy and Scipy. If necessary, we will
introduce Python. (The interpreter can be found on the web for a variety
of platforms.) However, the computational part is not absolutely necessary.
We will probably have a test in the middle covering classical approximation theory and a more comprehensive test at the end. Your requirements regarding tests etc. can be discussed in the first lecture.
|
| Resources: |
1) Classical Approximation Theory:
E.W. Cheney: Introduction to Approximation Theory, AMS/Chelsey
2) Modern Approximation Theory:
R. DeVore: "Nonlinear approximation", Acta Numerica (1998), pp. 51-150,
Cambridge University Press |
|
Return to Top
|
| Course: |
Partial Differential Equations |
| Lecturer: |
Jerry Kazdan |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
Partial Differential Equations (PDEs) arise in many applications to
physics, geometry, and more recently the world of finance. This will be
a basic course.
In real life one can find explicit solutions of very few PDEs -- and
many of these are infinite series whose secrets are complicated to
extract. For more than a century the goal is to understand the solutions
-- even though there may not be a formula for the solution.
The historic heart of the subject (and of this course) are the three
fundamental linear equations: wave equation, heat
equation, and Laplace equation along with a few nonlinear
equations such as the minimal surface equation and others that arise
from problems in the calculus of variations.
We seek insight and understanding rather than complicated formulas.
|
| Prerequisites: |
Linear algebra, calculus of several variables, and
basic ordinary differential equations. In particular I'll assume some
experience with the Stokes' and divergence theorems and a little Fourier
series. Some of this will be reviewed a bit as needed.
|
| Assessment: |
25% from assignments and 75% final exam. |
| Resources: |
The most important among the following are Strauss and Evans.
Strauss, Walter A., "Partial Differential Equations: An Introduction,"
New York, NY: Wiley, March 3, 1992.
John, Fritz. "Partial Differential Equations", 4th ed., Series:
Applied Mathematical Sciences, New York, NY: Springer-Verlag.
Courant, Richard, and Hilbert, David, "Methods of Mathematical
Physics," vol II. Wiley-Interscience, New York, 1962.
Evans, L.C., "Partial Differential Equations," American Mathematical
Society, Providence, 1998.
Jost, J., "Partial Differential Equations," Series: Graduate Texts
in Mathematics, Vol. 214 . 2nd ed., 2007, XIII, 356 p.
Kazdan, Jerry, "Lecture Notes on Applications of Partial Differential Equations to Some
Problems in Differential Geometry", available here.
|
|
Return to Top
|
| Course: |
Measure Theory |
| Lecturer: |
Marty Ross. Feel free to e-mail Marty if you have any questions by clicking here. |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
Measure theory is the modern theory of integration, the method of assigning a "size" to subsets of a universal set. It is more general, more powerful and more beautiful (though also more technical) than the classical theory of Riemann integration. The course will be a reasonably standard introduction to measure theory, with some emphasis upon geometric aspects. We will cover most (but definitely not all) of the topics listed below, subject to time and taste:
General Measure Theory (Outer measure, Measurable sets, Borel and Radon measures, the Caratheodory criterion for Borel measures)
Special Measures on Euclidean Space (Lebesgue measure, Hausdorff measure, the Vitali Covering Theorem, Hausdorff dimension)
Integration (Measurable functions, integration and convergence theorems, the Area Formula, iterated integrals and Fubini's Theorem)
Functional Analysis (Measures as linear functionals, Lp spaces, Riesz Representation Theorems)
Further Topics (Differentiation of measures, the Besicovitch Covering Theorem, the Generalised Fundamental Theorem of Calculus, the Co-Area Formula)
|
| Prerequisites: |
We'll assume familiarity with the fundamental concepts of analysis in Euclidean Space (infs and sups, open and closed sets, continuity, completeness and compactness, countability). Some corresponding familiarity with these notions in metric spaces would be helpful but will not be assumed; familiarity with these notions in topological spaces would be just peachy.
NOTE: Lecture notes summarising the relevant background on sets and real analysis are available here. Some (but definitely not all) of this material will be reviewed and covered along the way, particularly the material on metric spaces and topological spaces. Before the summer school begins, you should definitely take a good look at the background notes and, if need be, browse through a real analysis text or two.
|
| Assessment: |
I'm open to negotiation, but the proposal is: Problems assigned during lectures 50%, take-home exam 50%. |
| Resources: |
Lecture notes will be provided. We shall roughly follow the early chapters of Measure Theory and Fine Properties of Functions by Evans and Gariepy (CRC, 1991), though the book is extremely terse (and costs a King's ransom). There are many good texts on measure theory. Real Analysis by Royden (3rd ed., Prentice Hall, 1988) is good, and easy to find in libraries. Another good text is Foundations of Real and Abstract Analysis by Bridges (Springer-Verlag, 2005). Texts which cover probability as well will be less useful, as the language and approach tend to be quite different.
|
|
Return to Top
|
| Course: |
The Art and Science of Modeling, Analysing and Solving Decision-Making Problems |
| Lecturer: |
Moshe Sniedovich |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 lectures per
week. |
| Content: |
The objective of this course is to provide a gentle introduction to the complexities associated with the modeling and solution of practical decision-making problems in business, management and industry.
One of the main goals of this course is to enhance and enrich the mathematical modeling and problem solving skills of the students. To this end, an important ingredient of the subject is a demonstration that familiar abstract mathematical concepts, constructs and methods can be used effectively in the modelling, analysis and solution of practical decision-making problems.
The major topics covered will include:>
Decision-Making Problems
Famous Decision Theoretic Puzzles and Paradoxes
Classical Decision Theory
Mathematical Modeling Paradigms for Decision Analysis
Solution Methodologies
Game Theory
Sequential Decision Processes
Case Studies
|
| Prerequisites: |
Some prior exposure to probability theory and statistics will be useful but not essential.
|
| Assessment: |
2 hr final exam (last session) (90%) and 2 assignments (10%). |
| Resources: |
Lecture Notes, handouts, online web-based interactive modules. For those who wish to consult textbooks, the following are probably the most useful:
French, S., Decision Theory: an introduction to the mathematics of rationality, Ellis Horwood, 1988.
Winston, W.L., Operations Research: Applications and Algorithms, Duxbury, 1994.
|
|
Return to Top
|
| Course: |
Lie Groups
|
| Lecturer: |
John Stillwell |
| Duration: |
4 weeks, 14 Jan - 8 Feb 2008 |
|
Hours: |
7 hours of lectures per week |
| Content: |
This course is an introduction to Lie groups and Lie algebras,
assuming a minimum of prerequisites. To manage with elementary
prerequisites we stick to the class of matrix Lie groups (which
includes almost all the interesting examples), and mainly to the
so-called *classical groups*. The classical groups include the
general and special linear groups and groups of "rotations" of
linear spaces with real, complex, and quaternion coordinates.
It turns out that most of these groups are "almost simple" in a
sense that we clarify by investigating their Lie algebras. The
Lie algebra is a vector space (the tangent space of the Lie group
at its identity element) and hence easier to work with than the
Lie group itself. Nevertheless, the Lie algebra carries extra
algebraic structure -- the *Lie bracket* operation -- that
captures almost all of the group structure of the Lie group.
This enables us to show that a Lie group is almost simple by
showing that its Lie algebra is simple -- a result that can be
proved by elementary calculations with matrices.
The missing information about a Lie group that its Lie algebra
fails to capture is topological. We will explore topological
aspects of Lie groups to some extent, depending on the time
available.
|
| Prerequisites: |
Single-variable calculus and linear algebra. Some acquaintance
with basic group theory (normal subgroups and homomorphisms)
and analysis (convergence, limit points, continuity). |
| Assessment: |
20% from assignments and 80% final exam. |
| Resources: |
Complete notes for the course will be handed out, but for those
who wish to consult textbooks, the following are probably the
most useful:
B. Hall: Lie Groups, Lie Algebras, and Representations
(Springer 2003)
A. Baker: Matrix groups (Springer 2003)
K. Tapp: Matrix groups for Undergraduates (AMS 2005) |
|
Return to Top
|
|