Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the title matches:
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 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, June 4, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Stefan van Zwam

Sphere Packing with SDP

Speaker: Stefan van Zwam
Affiliation: CWI Amsterdam and University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The sphere packing problem in dimension $n$ asks for the maximum fraction of $\mathbb{R}^n$ that can be covered by (infinitely many) disjoint, equal-sized, $n$-dimensional spheres.

Friday, June 11, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Kevin Purbhoo

Eigenvalues of Hermitian matrices and the Belkale-Kumar product

Speaker: Kevin Purbhoo
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The story of this talk begins with the very classical Hermitian sum problem, which asks: if the eigenvalues of two Hermitian matrices are known, what can we say about the possible eigenvalues of their sum? 

Friday, June 18, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Ronald de Wolf

Quantum proofs for classical theorems

Speaker: Ronald de Wolf
Affiliation: CWI, Netherlands
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Quantum computing provides us with new algorithms and communication protocols, but the techniques developed in this field can also be used as tools for analyzing and proving results about *classical* algorithms and mathematical const

Friday, June 25, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Rahul Jain

The Partition Bound for Classical Communication Complexity and Query Complexity

Speaker: Rahul Jain
Affiliation: National University of Singapore
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs.

Friday, July 9, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Bruce Richter

Long cycles in 2-factors of 3-regular graphs

Speaker: Bruce Richter
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Petersen's Theorem says that every 2-connected, 3-regular graph has a 2-factor (i.e., a set of disjoint cycles whose union contains all the vertices). We are interested in finding the longest cycle that occurs in a 2-factor of such a graph.

Friday, July 16, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Bruce Richmond

Maximum Stirling Numbers of the Second Kind

Speaker: Bruce Richmond
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Say an integer n is exceptional if the maximum Stirling number of the second kind S(n,k) occurs for two (of necessity consecutive) values of k.

Friday, July 23, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Penny Haxell

Edge colouring multigraphs

Speaker: Penny Haxell
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We highlight a technique for studying edge colourings of multigraphs, due to Tashkinov. This method is a sophisticated generalisation of the method of alternating paths, and builds upon earlier work by Kierstead and Goldberg.

Friday, July 30, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Edwin van Dam

Eigenvalues, polynomials, and structure in graphs

Speaker: Edwin van Dam
Affiliation: Tilburg University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The eigenvalues of the adjacency matrix of a graph contain a lot --- but not always all --- information on the structure of the graph.

Friday, August 6, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Levent Tunçel

Local Quadratic Convergence of Polynomial-Time Interior-Point Methods for Nonlinear Convex Optimization Problems

Speaker: Levent Tunçel
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We propose new path-following predictor-corrector schemes for solving convex optimization problems in conic form.

Friday, September 10, 2010 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Joachim von zur Gathen

Census of polynomials

Speaker: Joachim von zur Gathen
Affiliation: B-IT, University of Bonn, Germany
Room: Mathematics & Computer Building (MC) 5158

Abstract:

How many reducible polynomials are there over a finite field? How many squareful ones? Decomposable? Our census looks at such minority polynomials, both multivariate and, for decomposable ones, univariate.