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, October 4, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jim Geelen

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 10, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Graph Theory seminar

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 11, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Marcel Silva

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 17, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Algebraic graph theory

Stable Polynomials and Ramanujan Graphs

Speaker: David Wagner
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 second of two lectures.)

Friday, October 18, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Karthekeyan Chandraskearan

Faster private release of marginals on small databases

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

Abstract:

The goal of privacy-preserving data analysis is to enable rich statistical analyses on the database while protecting the privacy of the individual records.

Thursday, October 24, 2013 1:00 pm - 2:30 pm EDT (GMT -04:00)

Algebraic graph theory

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 25, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jane Gao

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

Friday, November 1, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Laura Sanita

Finding small stabilizers for unstable graphs

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

Abstract:

A vertex v of a graph G is called inessential if there exists a maximum matching in G that exposes v. G is said to be stable if the set of its inessential vertices forms a stable set.

Tuesday, November 5, 2013 2:30 pm - 3:30 pm EST (GMT -05:00)

Seminar - Shuzhong Zhang

Recent Results on Tensor and Polynomial Optimization

Speaker: Shuzhong Zhang
Affiliation: University of Minnesota
Room: Mathematics and Computer Building (MC) 5158

Abstract

Tensor/polynomial optimization is a relatively new and active area of research in optimization. In this talk we shall present some new results on the computational models in tensor and polynomial optimization.

Tuesday, November 5, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Seminar - Michael P. Friedlander

Sparsity and gauge optimization

Speaker: Michael P. Friedlander
Affiliation: Department of Computer Science, University of British Columbia
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Gauge functions significantly generalize the notion of a norm, and gauge optimization is the class of problems for finding the element of a convex set that is minimal with respect to a gauge.