Events - October 2013

Friday, October 25, 2013 — 3:30 PM to 4:30 PM EDT

Solution geometry of a random k-XORSAT near the clustering threshold

Speaker: Jane Gao
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Since early 2000s statistical physicists predicted, using a non-rigorous
technique called the "cavity method", that the solution spaces of many

Thursday, October 24, 2013 — 1:00 PM to 2:30 PM EDT

Problems in Algebraic Graph Theory

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Problems in algebraic graph theory will be discussed.

Friday, October 18, 2013 — 3:30 PM to 4:30 PM EDT

Faster private release of marginals on small databases

Speaker: Professor Karthekeyan Chandraskearan
Affiliation: Harvard University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Thursday, October 17, 2013 — 3:30 PM to 4:30 PM EDT

Stable Polynomials and Ramanujan Graphs

Speaker: David Wagner
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Friday, October 11, 2013 — 3:30 PM to 4:30 PM EDT

The Boundary Structure of Spectrahedra Arising from the Lovász Theta Function

Speaker: Marcel Silva
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

The theta body TH(G) of a graph G is a semidefinite relaxation of
STAB(G), the stable set polytope of G, and it is contained in QSTAB(G),

Thursday, October 10, 2013 — 3:30 PM to 4:30 PM EDT

A Proof of the Manickam-Mikl\'{o}s-Singhi Conjecture for Vector Spaces

Speaker: Ameera Chowdhury
Affiliation: Carnegie Melon University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Let $V$ be an $n$-dimensional vector space over a finite field.
Assign a real-valued weight to each $1$-dimensional subspace in $V$ so

Friday, October 4, 2013 — 3:30 PM to 4:30 PM EDT

Rota's Conjecture

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

In 1970, Gian-Carlo Rota posed a conjecture giving a succinct
combinatorial characterization of the linear dependencies among a finite set of vectors in a vector space over any given finite field.

Thursday, October 3, 2013 — 3:30 PM to 4:30 PM EDT

Stable Polynomials and Ramanujan Graphs

Speaker: Andrew Childs
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We show how Marcus, Spielman and Srivastava use stable polynomials to
construct bipartite Ramunujan graphs of degree $k$ whenever $k\ge3$. (This will be the first of two lectures.)

S M T W T F S
29
30
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
31
1
2
  1. 2019 (157)
    1. November (10)
    2. October (18)
    3. September (15)
    4. August (9)
    5. July (17)
    6. June (18)
    7. May (16)
    8. April (9)
    9. March (24)
    10. February (13)
    11. 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)
    1. December (1)
    2. November (9)
    3. October (8)
    4. September (4)
    5. August (3)
    6. July (5)
    7. June (3)
    8. May (4)
    9. April (3)
    10. March (4)
    11. February (3)
    12. January (2)
  8. 2012 (39)
  9. 2011 (36)
  10. 2010 (40)
  11. 2009 (40)
  12. 2008 (39)
  13. 2007 (15)