## Organisers:

## Time:

## Venue:

Given a matrix A which is n x m, the image of A (viewed as a linear operator) is the space spanned by its m columns {c_1, ..., c_m} .

Speaker:

Rakesh Venkat, TIFR

Friday, 3 June 2016, 16:00 to 17:30

Given a matrix A which is n x m, the image of A (viewed as a linear operator) is the space spanned by its m columns {c_1, ..., c_m} .

Speaker:

Varun Narayanan, TIFR

Friday, 27 May 2016, 16:00 to 17:30

A randomized algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space was proposed by Martin Dyer, Alan Frieze and Ravi Kannan in 1988.

Abhishek Behera

Friday, 13 May 2016, 16:00 to 17:30

In this talk we will introduce the optimal transportation problem and mention some of its applications. We will then present the duality theory for the optimal transportation problem.

Speaker:

Nikhil S Mande, TIFR

Friday, 6 May 2016, 16:00 to 17:00

We will talk about the notion of the sign-rank of a {-1, 1}-valued matrix, which measures the robustness of it's rank under sign preserving changes. We will first see a neat geometric interpretation of the sign-rank, and then see how showing an u

Abhishek Behera

Friday, 15 April 2016, 16:00 to 17:00

One may wonder how do micro-organisms process spatially and temporally extensive information about their environment and respond in a manner that maximizes their fitness?

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 29 January 2016, 16:00 to 17:00

Abstract: In 1853, Liouville proved a fundamental result concerning approximations of algebraic numbers by rationals, which said one can't approximate algebraic numbers "well" using rationals.

Speaker:

Kshitij Gajjar, TIFR

Friday, 21 August 2015, 16:00 to 17:00

Abstract: Given a graph $G$, a valid colouring of $G$ is defined as an assignment of colours to the vertices of $G$ such that no two adjacent vertices share the same colour.

Pritam Bhattacharya

Friday, 12 June 2015, 14:00 to 15:30

Abstract: The art gallery problem is a classical sensor placement problem that asks for the minimum number of guards required to see every point in an environment.

Pritam Bhattacharya

Friday, 29 May 2015, 14:00 to 15:30

Abstract: The art gallery problem is to determine the minimum number of point light sources positioned at vertices of a polygon that can illuminate the entire polygon. Lee and Lin showed that this problem is NP-hard for direct visibility.

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 15 May 2015, 14:00 to 15:30

Abstract: The clique vs independent set game (CIS(G)) on a graph $G$ is a game between two parties - Alice and Bob.