## Organisers:

## Time:

## Venue:

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.

Speaker:

Prerona Chatterjee, TIFR

Friday, 6 April 2018, 17:15 to 18:15

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.

Sayan Bhattacharya

Friday, 13 April 2018, 11:45 to 12:45

Many real-world networks such as the ones arising out of facebook and twitter, webpages and hyperlinks etc. evolve with the passage of time.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 16 March 2018, 17:15 to 18:45

We discuss a technique that provides a sufficient condition for establishing a Markov chain on the joint distribution.

V.S. Borkar

Tuesday, 13 March 2018, 10:00 to 11:00

This talk will outline standard issues and results related to small noise limits in noise-perturbed dynamics and two important reasonsfor studying these, and illustrate the same by examples from the work ofthe speaker and his collaborators.

Amitalok J. Budkuley

Tuesday, 27 March 2018, 14:30 to 15:30

In Shannon's classical rate distortion problem, an encoder compresses data from a source into a message and sends it losslessly to the decoder.

Speaker:

Subhashini Krishnasamy, TIFR

Tuesday, 13 February 2018, 17:00 to 18:00

Scheduling problems in queueing systems have been long studied under the assumption that the service rates are known a priori.

Speaker:

Aditya Nema, TIFR

Friday, 2 February 2018, 17:15 to 18:45

In this talk I'll be presenting the result of Beigi et.al.

Pankaj S. Joshi

Tuesday, 6 February 2018, 14:30 to 15:30

Gravitational collapse of matter clouds is a fundamental process in astrophysics, cosmology, and black hole physics today.

Navin Kashyap

Thursday, 18 January 2018, 11:30 to 12:30

A binary m x n array is said to satisfy the two-dimensional (2-D) hard square constraint if no row or column of the array contains ones in consecutive positions. Let N(m,n) denote the number of such arrays.

Michel Mandjes

Tuesday, 23 January 2018, 14:30 to 15:30

Poisson processes are frequently used, e.g. to model the customer arrival process in service systems, or the claim arrival proces in insurance models.