## Organisers:

## Time:

## Venue:

Consider a system with K arms, arm $i$ yielding a payoff $X_{i}$, according to the distribution $P_{i}$.

Speaker:

Anand Deo, TIFR

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

Consider a system with K arms, arm $i$ yielding a payoff $X_{i}$, according to the distribution $P_{i}$.

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

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

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+

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.

Ashwin Deopurkar

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

This would be an elementary and concrete introduction to classical projective geometry. We'd start with Euclidean geometry of points, lines and circles.

Abhishek Khetan

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

In this talk we will discuss a topological proof of the fundamental theorem of algebra which states that any non-constant polynomial over the field of complex numbers has a complex root.

Speaker:

Neha ., TIFR

Friday, 27 April 2018, 16:00 to 17:00

In this talk, we will discuss the multiplicative weights algorithm and its application in approximately finding the optimal row and column strategies in a two player, zero sum game.

Speaker:

Anamay Tengse, TIFR

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

In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.