Scientific General Events
The ties between combinatorics and probability run so deep that for
many deep and interesting problems, it is nonsensical to try to assign
one category or the other. The subject of this workshop is these sorts
of problems, many of which in fact come from the theoretical computer
science and statistical physics communities. Most of the speakers
straddle two or several of these areas in their research. We expect the
workshop to both expose participants to cutting edge research in
combinatorics and probability, and, importantly, to lead to fruitful
discussions and the opening of new avenues of research.
Alberta Colleges Mathematics Conference - May 1 & 2, 2009
This annual conference presents talks on teaching issues specific to college math course offerings and provides an opportunity to meet colleagues from Alberta's post secondary institutions, discuss teaching, technology and curriculum and to share perspectives on experiences and common interests of mathematics in Alberta.
North South Dialogue in Mathematics - May 1, 2009
The annual Dialogue will take place Friday, running concurrently with the Alberta Colleges Mathematics Conference. This year will feature two consecutive sessions on:
Mathematical Biology & Mathematical Finance
Abstracts available in the download section of this page.
A one-day regional conference featuring five invited lectures with ample opportunity for interaction, discussion and socialization between participants.
- Pure mathematics; Applied mathematics & mathematical physics; Statistics; and Industrial & computational mathematics.
The Cascade Topology Seminar is a biennial gathering of topologists from the Pacific Northwest and Southwestern Canada.
The Hybridizable Discontinuous Galerkin Methods
This one-day conference builds on the success of the last five
"Combinatorics Day" events, all supported by PIMS. The purpose of the
"Combinatorics Day" is two-fold. First, to bring together people
working in different areas of combinatorics (primarily from Alberta
universities) to exchange ideas and to foster an environment for
cooperation. Second, to take advantage of the presence of many
prominent mathematicians at the Banff International Research Station
(BIRS) for a 5 day meeting on "Invariants of Incidence Matrices" from
March 29 to April 3, 2009.
This is a unique opportunity, and will be great for graduate students
and Faculty from the three Alberta universities.
The themes for the workshop are facts and uncertainties of climate change and its effects on coastal systems and marine safety, and the use of modern statistical tools to address some of these important issues.
This is a short course on Statistical Software and Extreme Value Analysis.
Combinatorial Game Theory---games of pure strategy where there are no chance devices---had its beginnings in 1902 and a major breakthrough in the theory was enunciated in the books "On Numbers and Games", Conway, 1978, and "Winning Ways", Berlekamp, Conway & Guy, 1980. This part of the theory works well when the games break up into components. This talk will look at the players in the area over the last 100 years---some who got it right, some who got it wrong, and some who just missed. At the same time, I will introduce some of the main concepts of Combinatorial Game Theory. Only High School level math is required to understand most of the talk, although having played a few games of (any of) Chess, Checkers, Go, Amazons or Nim will help.
Sections of line bundles on moduli spaces of sheaves on rational surfaces and Le Potier's strange duality
A k-configuration is a finite collection of n points and n lines, such that each of the n points is on precisely k lines and each line contains precisely k points. Some relevant results were known long ago, but the recent years have seen a large number of new results and novel problems. The development of the ideas will be sketched and some of the outstanding open questions described. A 3-configuration with n = 15 is shown below.
Please visit the external site by clicking here.
A graph is Hamilton-connected if for any two vertices u and v there is a Hamilton path whose terminal vertices are u and v. Similarly, a bipartite graph is Hamilton-laceable if for any two vertices u and v from distinct parts there is a Hamilton path with terminal vertices u and v. We present a survey of what is known about Hamilton-connected and Hamilton-laceable vertex-transitive graphs.