University of Calgary

Local Arthur packets are sets of representations of p-adic groups that help us realize important classes of automorphic forms. They have geometric analogues, called ABV-packets. This was first proposed for p-adic groups by David Vogan following his...

Overloading, which allows functions to exhibit different behaviors based on the types involved, is one of the most useful facilities of a typed programming language. In the Haskell programming language, this facility is provided by type classes. Type...

Reversible Knitting is a specialized branch of knitting focussed on creating fabric that looks beautiful on both sides, lies flat and doesn’t curl, and has a wonderful hand feel and texture. It is technically intriguing, creatively satisfying, and...

Coalgebraic modal logic is a set of approached to modal semantics that defines frames and models as coalgebras for a functor. This approach has captured the traditional notions of Kripke and Neighbourhood frames, as well as many other types of...

In this talk, I will report on joint work in progress (with Robin Cockett and Ben MacAdam) on how the additive bundle construction (almost) equips the category Lex of lex categories with a tangent category structure. Let Lex be the category of (small...

The category of polynomial functors in one variable and natural transformations between them is incredibly rich, e.g. it has infinitely many monoidal closed structures, including cartesian closure. Its substitution comonoids are categories and the...

Plato and Aristotle stated different conceptions of the good: mathematical order vs. human flourishing. These come together to the extent that mathematics promotes life, that mathematical language enables collectives to make sense of the world and...

This event will be a special iteration of the Western Canada Linear Algebra Meeting (WCLAM) to honour Peter Lancaster at 95. There is a large and thriving Linear Algebra community in Western Canada, where there is ongoing research in matrix analysis...

Foundational Methods in Computer Science is an annual workshop that brings together researchers in theoretical computer science and mathematics. Past workshopss have been held at BIRS, Colgate University, Dalhousie University, Mount Allison...

Room: MS 427 Time: 9:30am-11am. Monday 19 Aug: Khoa Nguyen (Calgary) will talk about heights and certain diophantine results in arithmetic dynamics. Tuesday 20 Aug: Andrew Bridy (Yale) will talk about arboreal Galois representations and finite index...