## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

A k-uniform hypergraph is defined to be q-rainbow colorable (q\leq k) if there exists a coloring of the vertex set with q colors such that every hyperedge contains all the q colors.

Amey Bhangale

Tuesday, 3 July 2018, 14:00 to 15:00

A k-uniform hypergraph is defined to be q-rainbow colorable (q\leq k) if there exists a coloring of the vertex set with q colors such that every hyperedge contains all the q colors.

Mrinal Kumar

Wednesday, 27 June 2018, 14:00 to 15:00

A well known fact is that there are polynomials of degree 2 (for instance, inner product, or elementary symmetric polynomials of degree 2), such that any representation of these as a sum of product of affine forms requires Omega(n) summands, where

Pritam Bhattacharya

Wednesday, 20 June 2018, 14:00 to 15:00

The art gallery problem deals with determining the minimum number of guards (or cameras) that are sufficient to cover or see every point in the interior of an art gallery, assuming that the guards have 360° visibility and can see an unbounded dist

Vishwas Bhargava

Monday, 28 May 2018, 16:00 to 17:00

We study the problem of deterministic factorization of sparse polynomials.

Arindam Khan

Thursday, 26 April 2018, 10:00 to 11:00

Multidimensional packing problems find numerous applications in robotics, cloud computing, smart-grids and many other scheduling and resource allocation problems.

Atreyee Kundu

Wednesday, 25 April 2018, 11:30 to 12:30

Switched systems find wide applications in power systems and power electronics, automotive control, aircraft and air traffic control, network and congestion control, etc.

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.

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.