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:
Thursday, February 28, 2019 3:30 pm - 3:30 pm EST (GMT -05:00)

Special Seminar - Yi-Shuai Niu

Title: Difference-of-SOS and Difference-of-Convex-SOS Decomposition Techniques for Polynomials

Speaker: Yi-Shuai Niu
Affiliation:

SJTU-Paristech & Maths department Shanghai Jiao Tong University

Room: MC 5501

Abstract:

We are interested in polynomial decomposition techniques for reformulating any multivariate polynomial into difference-of-sums-of-squares (DSOS) and difference-of-convex-sums-of-squares (DCSOS) polynomials.

Wednesday, March 6, 2019 3:30 pm - 3:30 pm EST (GMT -05:00)

Graph and Matroids Seminar- Anton Bernshteyn

Title: Free subshifts and the Local Lemma

Speaker: Anton Bernshteyn
Affiliation: Carnegie Mellon University
Room: MC 5501

Abstract: The purpose of this talk is to demonstrate how combinatorial tools and techniques can be used to tackle problems in other areas of mathematics, specifically,

Thursday, March 7, 2019 4:00 pm - 4:00 pm EST (GMT -05:00)

Continuous Optimization Seminar- Courtney Paquette

Title: Introduction to high-dimensional probability: some basic concentration inequalities and useful distributions

Speaker: Courtney Paquette
Affiliation: University of Waterloo
Room: MC 5417

Abstract: In this seminar, we introduce important tools from high-dimensional probability useful in studying applications in data science such as covariance estimation, matrix completion,

Friday, March 8, 2019 1:00 pm - 1:00 pm EST (GMT -05:00)

Combinatorial Optimization Reading Group- Akshay Ramachandran

Title: On the Hardness of 4-coloring a 3-colorable graph

Speaker: Akshay Ramachandran
Affiliation: University of Waterloo
Room: MC 5479

Abstract: A consequence of the PCP theorem is that it is NP-hard to approximate the chromatic number of a general graph to within \n^{1-\eps} for any constant epsilon.

Friday, March 8, 2019 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Anton Bernshteyn

Title: From graph theory to set theory and back

Speaker: Anton Bernshteyn
Affiliation: Carnegie Mellon University
Room: MC 5501

Abstract:

Many results in finite combinatorics can be extended to infinite structures via compactness---but this transfer is powered by the Axiom of Choice and leads, in general, to highly "pathological" objects.