## Organisers:

## Time:

## Venue:

The Birkhoff-Von Neumann is a structure theorem characterizing the extremal points of the convex set of doubly stochastic matrices.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 18 November 2016, 16:00 to 17:30

The Birkhoff-Von Neumann is a structure theorem characterizing the extremal points of the convex set of doubly stochastic matrices.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 11 November 2016, 16:00 to 17:30

In 1977, J.A. Davis et al showed that any finite subset of natural numbers can be permuted such that it does not contain any 3-term A.P. as a sub-sequence. However, this is not true for the set of all natural numbers.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 4 November 2016, 16:00 to 17:30

Peer reviewing is not just an important part of research, but also one of the main characteristics of scientific temper. However, over millions of years, we have evolved into selfish beings, and we attempt to maximize our benefits.

Speaker:

Nikhil S Mande, TIFR

Friday, 21 October 2016, 16:00 to 17:30

We consider the unbounded error communication complexity of XOR functions, i.e. those of the form f of XOR, where f is an arbitrary boolean function on n bits.

Speaker:

Varun Narayanan, TIFR

Friday, 14 October 2016, 16:00 to 17:30

DNA sequencing is the basic workhorse of modern day biology and medicine.

Speaker:

Gunjan Kumar, TIFR

Friday, 7 October 2016, 16:00 to 17:30

We present algorithmic applications of an approximate version of Caratheodory's theorem.

Speaker:

Anamay Tengse, TIFR

Friday, 30 September 2016, 16:00 to 17:30

The max-coloring problem is to compute a legal coloring of the vertices of a graph $G=(V,E)$ with vertex weights $w$ such that $sum^k_{i=1} max_{v \in C_i} w(v_i)$ is minimized, where $C_1, \ldots ,C_k$ are the various color classes.

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 16 September 2016, 16:00 to 17:30

One of the basic questions in complexity theory is how the complexity of computing $k$ instances of a function relates to the complexity of computing a single instance.

Speaker:

Prerona Chatterjee, TIFR

Friday, 9 September 2016, 16:00 to 17:30

The compactness theorem states that there is a model for an infinite set S of propositional formulas, if and only if, there is a model for every finite subset of S.

Speaker:

Anand Deo, TIFR

Friday, 2 September 2016, 16:00 to 17:30

The Brownian motion is one of the most interesting and useful of all Stochastic Processes. It has an enormous range of applications ranging from physics (Einstein) to finance (starting with Bachelier).