Benjamin Rossman, University of Toronto - Lauréat 2018 du Prix André-Aisenstadt

Friday, November 2, 2018 16:00to17:00

The complexity of detecting cliques and cycles in random graphsPav. André-Aisenstadt, CA/mathstatCategory: Dept. of Mathematics and Statistics

Ilya Gekhtman, University of Toronto

Wednesday, October 31, 2018 15:00to16:00

Growth rates of invariant random subgroups in negative curvature805 rue Sherbrooke Ouest, Montreal, QC, H3A 0B9, CA/mathstatCategory: Dept. of Mathematics and Statistics

David Coeurjolly, CNRS, France

Tuesday, October 30, 2018 15:30to16:30

Low Discrepancy and Blue Noise Sampling in Computer GraphicsPavillon President-Kennedy, CA/mathstatCategory: Dept. of Mathematics and Statistics

Geoffroy Bergeron, CRM

Tuesday, October 30, 2018 15:30to16:30

$SU_q(3)$ corepresentations and multivariate q-Krawtchouk polynomialsPav. André-Aisenstadt, 2920, ch. de la Tour, CA/mathstatCategory: Dept. of Mathematics and Statistics

Lecture by Benjamin Rossman, 2018 André-Aisenstadt Prize Recipient

Friday, November 2, 2018 16:00to17:00

The complexity of detecting cliques and cycles in random graphs Pav. André-Aisenstadt, CA/mathstatCategory: Dept. of Mathematics and Statistics

Dehan Kong (University of Toronto)

Friday, October 26, 2018 15:30to16:30

Object Oriented Data Analysis with Application to Neuroimaging Studies Abstract: 805 rue Sherbrooke Ouest, Montreal, QC, H3A 0B9, CA/mathstatCategory: Dept. of Mathematics and Statistics

Xinyi Li (University of Chicago)

Monday, October 29, 2018 14:00to15:00

Title:One-point function estimates and natural parametrization for loop-erased random walk in three dimensions805 rue Sherbrooke Ouest, Montreal, QC, H3A 0B9, CA/mathstatCategory: Dept. of...

Pages

Follow us on

Back to top