## 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.

Speaker:

Aditya Nema, TIFR

Friday, 29 June 2018, 17:15 to 18:15

In this talk, we shall discuss the fully quantum Slepian Wolf theorem and it's proof (Winter et al).

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

Speaker:

Sayantan Chakraborty, TIFR

Friday, 22 June 2018, 17:15 to 18:15

We shall discuss classical rate distortion, i.e., message compression with a distortion criterion, in the one-shot setting with and without side information at the decoder. The rate distortion problem with side information at the decoder is also c

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

Speaker:

Kshitij Gajjar, TIFR

Friday, 15 June 2018, 17:15 to 18:15

Hansel's lemma (not Hensel's lemma) states that if the complete graph on $n$ vertices can be expressed as the union of $r$ bipartite graphs $B_1,B_2,\ldots,B_r$ such that $n_i$ is the number of non-isolated vertices in $B_i$, then $n_1+n_2+\cdots+

P.R. Kumar

Thursday, 7 June 2018, 11:00 to 12:00

Inspired by classical results in real-time scheduling, we consider a model of an access point serving several flows, and provide a possibly surprising characterization of what throughput vectors feasible, as well as throughput-optimal scheduling p

Vishwas Bhargava

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

We study the problem of deterministic factorization of sparse polynomials.

Speaker:

Anamay Tengse, TIFR

Friday, 25 May 2018, 17:15 to 18:15

Non-commutative algebraic circuits are those in which the variables do not commute under multiplication. Additionally, a circuit is called monotone if it does not use subtractions or negative constants.

Sagar Shrivastav

Friday, 18 May 2018, 17:15 to 18:15

Origami is the art of paper folding. It can also be described mathematically with a set of seven axioms, which are complete. In this talk, we will see the following.