Events

Three types of Schur function product and generating functions for the coefficients appearing in their decomposition

Abstract:

Outer, inner and reduced inner products of Schur functions will be defined and exemplified.

Twisted duality and isomorphism of medial graphs

Abstract:

This talk revolves around two fundamental constructions in graph theory: duals and medial graphs. There are a host of well-known relations between the duals and the medial graphs of plane graphs.

SemiDefinite Programming Relaxation for Polynomial Optimization Problems

Abstract:

Polynomial Optimization Problem (POP) is the problem of minimizing a polynomial objective function over a set defined by finite many polynomial equalities and/or inequalities.

The eighth Mixed Integer Programming (MIP) Workshop was held at the University of Waterloo from June 20-23 2011. The workshop was organized by Samir Elhedhli (Department of Management Sciences) and Ricardo Fukasawa (Department of Combinatorics and Optimization).

Price of Correlation in Stochastic Optimization

Abstract:

Stochastic programming and robust optimization are classical methodologies for making decisions in the presence of high dimensional stochastic data.

Quantum-resistant public-key cryptosystems from supersingular elliptic curve isogenies

Abstract:

We present a new construction of quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves.

A Primal-Dual Approximation Algorithm for Min-Sum Single Machine Scheduling Problems

Linear-programming based techniques for minimum latency problems

Abstract:

We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems.

Complex spherical codes and designs

Abstract:

Real spherical designs have been shown by Delsarte, Goethals, and Seidel to give rise to association schemes when the strength of the design is high compared to its degree as a code.

Locally Restricted Compositions

Abstract:

A composition of n is a finite list of positive integers c₁,...,c_k (called the parts) that sum to n.