Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Monday, December 12, 2022 3:00 pm - 3:00 pm EST (GMT -05:00)

Graphs and Matroid Seminar - Cléophée Robin

Title: When all holes have the same length

Speaker: Cléophée Robin
Affiliation: University of Waterloo
Location: MC 6029

Abstract: A hole is an induced cycle of length at least 4. For an integer k ≥ 4, we denote by Ck, the class of graphs where every hole has length k. We have defined a new class of graphs named blowup of ℓ-templates whose all holes have length 2ℓ + 1. Using earlier results on other related classes of graphs, we did obtain the following structural theorem :

Tuesday, December 13, 2022 3:30 pm - 3:30 pm EST (GMT -05:00)

IQC MATH CS Seminar - Mario Szegedy

Title: Generating k EPR-pairs from an n-party resource state

Speaker: Mario Szegedy
Affiliation: Rutgers University
Location: QNC 0101 or contact Eva Lee for Zoom lin

Abstract: Motivated by quantum network applications over classical channels, we initiate the study of n-party resource states from which LOCC protocols can create EPR-pairs between any k disjoint pairs of parties.

Friday, December 16, 2022 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Daniel Panario

Title: Probabilistic root finding in code-based cryptography

Speaker: Daniel Panario
Affiliation: School of Mathematics and Statistics, Carleton University
Location: MC 5501 or contact Eva Lee for Zoom link

Abstract: Factorization of polynomials over finite fields, and the particular subproblem of finding roots of polynomials, have many applications in diverse areas such as computer algebra, cryptography and coding theory, among many others. In practice, fast factorization algorithms are probabilistic.