## Organisers:

## Time:

## Venue:

A graph is said to be perfect if the chromatic number of every induced subgraph equals its clique number.

Speaker:

Abhishek Singh, TIFR

Friday, 13 January 2017, 16:00 to 17:30

A graph is said to be perfect if the chromatic number of every induced subgraph equals its clique number.

Swagato Sanyal

Friday, 6 January 2017, 16:00 to 17:30

Linear sketch complexity of a Boolean function f on a set of n inputs, introduced by Kannan, Mossel and Yaroslavtsev, is, in informal terms, the smallest integer d such that the value of the function can be concluded with high probability from the

Speaker:

Suhail Sherif, TIFR

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

Lee and Zhang showed that the communication complexity of "f composed with g" is high when f is hard to approximate with a low degree polynomial (also g has to be from a good class of functions, more details will be given in the talk).

Speaker:

Sagnik Mukhopadhyay, TIFR

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

We will consider the problem of elimination in communication complexity, that was first raised by Ambainis et al. and later studied by Beimel et al. for its connection to the famous direct sum question.

Speaker:

Tulasi mohan Molli, TIFR

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

The isoperiemtric profile of a Graph is a function that measures, for an integer k, is the size of the smallest edge boundary over all sets of vertices of size k.

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.