# Events

## September 2015

Sun Mon Tue Wed Thu Fri Sat
30
31
1
2
3
4
5

6
7
8
9
10
11
12

13
15
17
18
19

20
26

27
1
2
3

### Pure Math Colloquium

Monday, September 14, 2015 — 4:00 PM EDT

Dinesh Thakur, University of Rochester

“What should be pi, e, zeta(3), Gamma(1/7), if integers are replaced by polynomials?”

We will explain the title and talk about relations between these quantities.

MC 5501

Refreshments will be served in MC 5403 at 3:30 p.m. Everyone is welcome to attend.

### Analysis Comprehensive Seminar

Wednesday, September 16, 2015 — 10:30 to 10:30 AM EDT

Jaspar Wiart, Department of Pure Math, University of Waterloo

“Nuclear and exact C*-algebras”

This will be an overview of the two definitions of nuclear and exact C*-algberas via com- pletely positive maps and exact sequences, and an outline of how the equivalence is established.

MC 5403

### Computability Learning Seminar

Wednesday, September 16, 2015 — 3:30 PM EDT

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

“Algorithmic Randomness: Introduction to Kolmogorov Complexity”

The topic for the Computability Learning Seminar this term will be Algorithmic Random- ness. We will be following Nies’s book, Computability and Randomness.

### Pure Math Colloquium

Monday, September 21, 2015 — 4:00 PM EDT

Michael F. Singer North Carolina State University

“Differential Groups and the Gamma Function”

### Logic Seminar

Tuesday, September 22, 2015 — 2:30 PM EDT

Juan Felipe Carmona, Universidad Antonio Nariño

"Flatness and CM-triviality in strongly minimal theories with a predicate"

### Student Number Theory Seminar

Tuesday, September 22, 2015 — 2:30 PM EDT

Anton Mosunov, Department of Pure Mathematics, University of Waterloo

“Basic definitions and examples in the theory of modular forms”

### Fractal Geometry Seminar

Wednesday, September 23, 2015 — 2:30 PM EDT

Anthony McCormick, Pure Math Department, University of Waterloo

“Recent Methods for Computing the Hausdorff Dimension of a Self-Similar Set”

### Algebra Seminar

Thursday, September 24, 2015 — 2:30 PM EDT

Blake Madill, Department of Pure Mathematics, University of Waterloo

“On rings graded by semigroups with a unique product property”

### Analysis Seminar

Friday, September 25, 2015 — 3:30 PM EDT

Chris Schafhauser, Department of Pure Math, University of Waterloo

“Quasidiagonal Traces and Crossed Products”

### Pure Math Colloquium

Monday, September 28, 2015 — 4:00 PM EDT

M. Ram Murty, Queen’s University

“NEW DIRECTIONS IN SIEVE THEORY”

### Number Theory Seminar

Monday, September 28, 2015 — 9:30 PM EDT

Ram Murty, Queen’s University

“The theory of Ramanujan expansions”

### Ring Theory Learning Seminar

Tuesday, September 29, 2015 — 11:30 to 11:30 AM EDT

Patrick Naylor, Pure Mathematics, University of Waterloo

"Semisimplicity and the Hopkins--Levitski Theorem"

This semester we'll be meeting weekly to learn more about ring theory, mostly going through Lam's two books --- there are many interesting results in those books which will be "good to know". Starting off, we'll aim to learn the Hopkins--Levitski Theorem, one of whose (many) consequences is that the descending chain condition implies the ascending chain condition. Everyone is welcome. See you there!

MC 5403

### Seminar on Modular Forms

Tuesday, September 29, 2015 — 2:30 PM EDT

Anton Mosunov, Pure Mathematics, University of Waterloo

"Congruence subgroups and examples of forms that are modular with respect to these subgroups"

This week, we will look at the definition of cusp forms, and consider the most famous example of the cusp form of weight 12, which is the discriminant function. Afterwords, we shall move to the discussion of congruence subgroups, and will look at forms that are modular with respect to particular congruence subgroups.

MC 5479

### Algebra Seminar

Wednesday, September 30, 2015 — 2:30 PM EDT

Jason Bell, Pure Mathematics, University of Waterloo

"The noncommutative Zariski Cancellation Problem"

### Computability Learning Seminar

Wednesday, September 30, 2015 — 3:30 PM EDT

Mohammad Mahmoud, Pure Mathematics, University of Waterloo

"Algorithmic Randomness: Introduction to Kolmogorov Complexity"

Last time we saw why the Kolmogorov complexity $K$ can be better than the plain complexity $C$ as it is subadditive and complexity doesn't dip. This time we are going to see more properties showing that $K$ matches our intuition. More precisely, (a) Incompressible (in the sense of $K$) strings have only short runs of zeros (i.e. blocks only consisting of zeros), and (b) Zeros and ones occur balancedly.

MC 5403

### September 2015

S M T W T F S
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
15
17
18
19
20
26
27
1
2
3
1. 2020 (22)
1. January (22)
2. 2019 (199)
1. December (7)
2. November (26)
3. October (19)
4. September (13)
5. August (7)
6. July (12)
7. June (18)
8. May (22)
9. April (11)
10. March (25)
11. February (17)
12. January (22)
3. 2018 (219)
4. 2017 (281)
5. 2016 (335)
6. 2015 (209)
1. December (7)
2. November (39)
3. October (38)
4. September (15)
5. August (10)
6. July (18)
7. June (24)
8. May (12)
9. April (2)
10. March (27)
11. January (17)
7. 2014 (235)
8. 2013 (251)
9. 2012 (135)