Events

How to Count Positive Braids (or These Aren't The Droids You're Looking For)

Abstract:

Braids can be thought of in many different ways, most commonly as a geometric object or as a group. In this talk I will review a certain class of braids (positive braids) that is not a group, but a monoid.

A branch and bound algorithm based on approximate binary Decision diagrams

Abstract:

In this talk we discuss a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation.

Intersecting determinantal ideas

Abstract:

I will talk about a class of ideals whose generators are of the form "all of the size d minors of the northwest i by j portion of a matrix of variables." I'll talk about how these ideals and their generators lead to some nice combinatorics involving the antidiagona

Convex sets, convex optimization and some inequalities

Abstract:

We will start by touching on a few fundamental concepts in convex optimization. Then, we will venture on a journey guided by some recent developments.

Strong-majority bootstrap percolation on regular graphs

Abstract: 

Consider the following process of dissemination of information over a network. Given a graph, we initially pick a (random) subset of informed vertices called active. Active vertices remain active forever.

Achieving target equilibria in network routing games without knowing the latency functions

Abstract:

Network routing games are game-theoretic models of traffic in networks.

The Power of Deferral: Maintaining the Constant-Competitive Steiner Tree a result by Albert Gu, Anupam Gupta, Amit Kumar

Abstract:

Doors will open at 4:15 p.m. As usual we will have 15 mins for socializing and for eating pizza before the talk starts (at 4:30 p.m. sharp).

Some instances of the cyclic sieving phenomenon on increasing tableaux

Abstract:

Let X be a finite set, <g> a cyclic group of order n acting on X and f a polynomial in Z[q].

Maximizing Social Influence in Nearly Optimal Time a result by Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier (SODA14)

Door will open at 4:15 p.m. As usual we will have 15 mins for socializing and for eating pizza before the talk starts (at 4:30 p.m. sharp).

Studying Edmonds' trick of bi-directing edges

Abstract:

A classic well-studied problem in combinatorial optimization is that of finding a minimum weight spanning tree of a graph.