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:
Friday, March 23, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Padraig O Cathain

Title: Morphisms of complex Hadamard matrices

Speaker: Padraig O Cathain
Affiliation: Worcester Polytechnic University
Room: MC 5501

Abstract:

Let M be a matrix with complex entries of unit norm. A well-known theorem of Hadamard bounds the magnitude of the determinant of M as a function of its dimension, and M is a complex Hadamard matrix if M meets Hadamard's bound with equality.

Wednesday, March 28, 2018 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Matthew William Slavin

Title: Tractable Approximations to Robust Conic Optimization Problems (paper by D. Bertsimas, M. Sim)

Speaker: Matthew William Slavin
Affiliation: University of Waterloo
Room: MC 5479

Abstract: We review the paper listed in the title of this talk. In the paper, Bertsimas and Sim propose a relaxed robust counterpart for general conic optimization problems

Monday, April 2, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Cryptography Seminar- Ted Eaton, Geovandro Pereira & John Schank

There are 3 short talks this week.

Title: Quantum Collision-Finding in Non-Uniform Random Functions

Speaker: Ted Eaton
Affiliation: ISARA Corporatio
Room: MC 6486

Abstract: Proving the security of a scheme against a quantum adversary often makes the strong assumption of modelling the hash function as uniformly random. In this work, we study the generic security of non-uniform random functions, specifically those with min-entropy k. This has applications to the quantum security of the Fujisaki-Okamoto transformation, as well as allowing for more relaxed security assumptions. We discuss previous results and sketch a proof for an asymptotic upper and lower bound of 2k/3 quantum queries. 

Tuesday, April 3, 2018 10:00 am - 10:00 am EDT (GMT -04:00)

Special Seminar - Paul Seymour

Title: Erdos-Hajnal meets Gyarfas-Sumner

Speaker: Paul Seymour
Affiliation: Princeton
Room: QNC 1501

Abstract:

The Gyarfas-Sumner conjecture says that every graph with huge (enough) chromatic number and bounded clique number contains any given forest as an induced subgraph. (And non-forests do not have this property.)