Events - April 2018

Friday, April 27, 2018 — 3:30 PM EDT

Title: Spins Lattices, Graphs and Quantum State Revivals

Speaker: Luc Vinet
Affiliation: Université de Montréal
Room: MC 5501

Abstract:

This talk will describe how certain features of quantum transport along spin chains can be enabled.

Friday, April 20, 2018 — 3:30 PM EDT

Title: Transversals in covers of graphs

Speaker: Krystal Guo
Affiliation: Université Libre de Bruxelles
Room: MC 5501

Abstract:

We study a polynomial with connections to correspondence colouring (also known as DP-colouring) and the Unique Games Conjecture.

Friday, April 13, 2018 — 3:30 PM EDT

Title: Interpolating between the characteristic and matching polynomials of a graph

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

The characteristic polynomial Φ(X, t) of a graph X has two obvious combinatorial connections.

Wednesday, April 11, 2018 — 4:00 PM EDT

Title: Robust discrete optimization and network flows (paper by Bertsimas and Sim)

Friday, April 6, 2018 — 3:30 PM EDT

Title: Generating Functions: Theory, Algorithms, and Applications

Speaker: Stephen Melczer
Affiliation: University of Pennsylvania
Room: MC 5501

Abstract:

Generating functions are an invaluable tool in many areas of discrete mathematics and beyond.

Thursday, April 5, 2018 — 1:30 PM EDT

Title: Graphs and Unitals

Wednesday, April 4, 2018 — 4:00 PM EDT

Title: Robust Solutions of Optimization Problems Affected by Uncertain Probabilities (paper by Ben-Tal A et al )

Tuesday, April 3, 2018 — 10:00 AM EDT

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.)

Monday, April 2, 2018 — 1:00 PM EDT

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. 

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
  1. 2019 (168)
    1. December (6)
    2. November (15)
    3. October (18)
    4. September (15)
    5. August (9)
    6. July (17)
    7. June (18)
    8. May (16)
    9. April (9)
    10. March (24)
    11. February (13)
    12. January (8)
  2. 2018 (138)
    1. December (2)
    2. November (18)
    3. October (14)
    4. September (9)
    5. August (2)
    6. July (10)
    7. June (13)
    8. May (17)
    9. April (9)
    10. March (19)
    11. February (14)
    12. January (11)
  3. 2017 (103)
  4. 2016 (137)
  5. 2015 (136)
  6. 2014 (88)
  7. 2013 (48)
  8. 2012 (39)
  9. 2011 (36)
  10. 2010 (40)
  11. 2009 (40)
  12. 2008 (39)
  13. 2007 (15)