Past Events

We present a family of mixed finite elements suitable for discretization of the Navier-Stokes and Darcy equations. It is inf-sup stable and consistent for both equations, such that arbitrarily high order approximations can be achieved by increasing...

6:30 - 8:00 p.m. Tuesday, March 3, 2009 Frank Hobbs Elementary School 3875 Haro Road, Victoria BC (250) 477-1804 For more information contact: Admin Assistant, PIMS, Dept of Math and Stats UVic (250) 472-4271 Email: pims@math.uvic.ca

Spatially localized structures occur widely across the physical sciences. Classic examples include localized buckling of slender structures, localized oscillations in vertically vibrated granular media (oscillons) and localized convection in fluid...

Time and Date: 1:30 p.m., Friday, February 27, 2009 Event: PIMS/WMAX Postdoctoral Colloquium Subject: ``Isomorphism problem for group algebras and enveloping algebras'' Location: WMAX 216 Abstract: The celebrated work of Roggenkamp & Scott and Weiss...

Recent work has shown that one physical interpretation of the coordinate transformation invariance of Maxwell's equations can be expressed as an electromagnetic material with transformed permittivity and permeability values defined in the original...

In 1849, Dirichlet showed that sum_{n le x} d(n) = x(log x+2gamma-1)+Delta(x) with Delta(x) ll sqrt{x} where d(n) counts the number of divisors of n and gamma is the Euler constant. An interesting problem is to study the behaviour of Delta(x), for...

I'll discuss some connections between algorithms for finding rational points on curves and some cryptosystems. Akiyama and Goto have proposed a cryptosystem based on rational points on curves over function fields (stated in the equivalent form of...

The outer automorphism group Out(F) of a free group F of finite rank shares many properties with the mapping class group of a surface, however the techniques for studying these groups are generally quite different. Analogues of the pseudo-Anosov...

In symbolic dynamics, a Z^d shift of finite type (or SFT) is the set of all ways to assign elements from a finite alphabet A to all sites of Z^d, subject to rules about which elements of A are allowed to appear next to each other. A simple example of...