Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

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 4, 2011 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Gelasio Salazar

Sylvester's Four Point Constant: closing in (or are we?)

Speaker: Gelasio Salazar
Affiliation: Universidad Autonoma de San Luis Potosi, Mexico
Room: Mathematics & Computer Building (MC) 5158

Abstract:

In the April 1884 edition of The Educational Times, Sylvester asked: what is the probability that four points chosen at random in the plane form a convex quadrilateral?

Friday, March 18, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Sergey Norin

Exponentially many perfect matchings in cubic graphs

Speaker: Sergey Norin
Affiliation: Princeton University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A well-known conjecture of Lovasz and Plummer asserts that the number of perfect matchings in 2-edge-connected cubic graph is exponential in the number of vertices.

Friday, March 25, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jim Geelen

Characterizing graphic matroids by a system of linear equations

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

Abstract:

Given a rank-r binary matroid M, we construct a system of O(r3) linear equations in O(r2) variables that has a solution over GF(2) if and only if M is gr

Friday, April 1, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Cris Moore

Approximate Representations and Approximate Homomorphisms

Speaker: Cris Moore
Affiliation: University of New Mexico and the Santa Fe Institute
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Approximate algebraic structures play a defining role in arithmetic combinatorics.

Friday, April 8, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Ben Recht

The Convex Geometry of Inverse Problems

Speaker: Ben Recht
Affiliation: University of Wisconsin
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Deducing the state or structure of a system from partial, noisy measurements is a fundamental task throughout the sciences and engineering.

Friday, April 15, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Alexander Engström

Tverberg's theorem and graph coloring

Speaker: Alexander Engström
Affiliation: University of California, Berkeley
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Tverberg's theorem is a generalization of Radon's theorem in discrete geometry. It states that any set of N=(d+1)(r-1)+1 points in R^d can be partitioned into r subsets such that the intersection of their convex hulls is non-empty.

Friday, April 29, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Brendan McKay

Recursive structure of planar graph classes

Speaker: Brendan McKay
Affiliation: Australian National University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A recursive characterisation of a class of graphs consists of a set of starting graphs in the class, together with a set of operations that modify one graph in the class to form another.

Friday, May 6, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Bruce Richter

Zarankiewicz' Conjecture is finite

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

Abstract:

Zarankiewicz' Conjecture states that the crossing number of the complete bipartite graph K(m,n) is [m/2] [(m-1)/2)] [n/2] [(n-1)/2]. To date, this has been proved only for n≤5 (Kleitman in 1971) and a few other values.

Friday, May 20, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Igor Shparlinski

Graphs and Matrices with Integral Spectrum in Some Families

Speaker: Igor Shparlinski
Affiliation: Macquarie University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We give a survey of recent result about counting of graphs and matrices (of various types) with integral eigenvalues. We also pose several open problems.

Friday, May 27, 2011 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Henry Wolkowicz

Strong Duality in Semidefinite Programming and Facial Reduction with Applications to Sensor Network Localization and Molecular Conformation

Speaker: Henry Wolkowicz
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The Slater constraint qualification (SCQ) is essential for many classes of convex programs, e.g., Linear Programming (LP), ordinary convex programmi