## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: Efficient quantum codes are a necessary building block in the eventual design of quantum computers.

Piyush P. Kurur

Tuesday, 14 October 2014, 10:00 to 11:00

Abstract: Efficient quantum codes are a necessary building block in the eventual design of quantum computers.

Speaker:

Pritam Bhattacharya, TIFR

Friday, 26 September 2014, 14:00 to 15:30

Abstract: The VERTEX GUARD (VG) problem is defined as follows: Given a polygon P (with holes allowed) with n vertices, find a smallest subset S of the set of vertices of P such that every point in the polygon P can be

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 19 September 2014, 14:00 to 15:30

Abstract: We discuss a proof of the classical CLT (in Wasserstein metric) using Stein's Lemma.

Satwik Mukherjee

Friday, 22 August 2014, 14:00 to 15:30

Abstract: I will sketch the proof as given by C. Reiher.

Ankit Garg

Thursday, 21 August 2014, 16:00 to 17:00

Abstract: We prove a parallel repetition theorem for general games with value tending to 0. Previously Dinur and Steurer proved such a theorem for the special case of projection games. We use information theoretic techniques in our proof.

Arnab Bhattacharyya

Monday, 11 August 2014, 10:00 to 11:00

Abstract: Regularity is a notion of “pseudorandomness” that allows one to decompose a given object into a collection of simpler objects which appear random according to certain statistics.

Tulsi Mohan Molli

Friday, 8 August 2014, 14:30 to 16:00

Abstract: In this talk I will discuss some linear algebraic methods to prove lower bounds.

Venkat Anantharam

Tuesday, 5 August 2014, 16:00 to 17:00

Abstract: Consider an irreducible continuous time Markov chain with a finite or a countably infinite number of states and admitting a unique stationary probability distribution.

Amey Bhangale

Friday, 1 August 2014, 14:30 to 16:00

Abstract: A Kakeya set is a subset of [image: F^n], where [image: F] is a finite field of [image: q] elements, that contains a line in every direction. What can we say about the size of this set? How large the size of the set must be?

Speaker:

Gugan Thoppe, TIFR

Friday, 11 July 2014, 14:30 to 16:00

Abstract: Mathew Kahle and Elizabeth Meckes recently established interesting results concerning the topology of the clique complex $X(n,p)$ on an Erdos Renyi graph $G(n,p).$ Specifically, they showed that, if $p = n^{\alpha}$