## Organisers:

## Time:

## Venue:

**Abstract: **The best known lower bound for general algebraic circuits was given by Baur and Strassen [BS83].

Speaker:

Prerona Chatterjee, TIFR

Friday, 15 March 2019, 17:15 to 18:15

**Abstract: **The best known lower bound for general algebraic circuits was given by Baur and Strassen [BS83].

Speaker:

Anamay Tengse, TIFR

Friday, 8 March 2019, 17:15 to 18:15

**Abstract: **For a class of polynomials P, a set of evaluation points H is said to be a hitting set if any nonzero polynomial P is nonzero on some point in H.

Speaker:

Prabhat Kumar Jha, TIFR

Friday, 1 March 2019, 17:15 to 18:15

**Abstract: **Linear loop programs are while programs with a linear loop condition and linear assignments as loop body. In this talk we will discuss proof of decidability of a class of linear loop programs (due to A. Tiwari).

Speaker:

Sayantan Chakraborty, TIFR

Friday, 22 February 2019, 17:15 to 18:15

**Abstract:** In this talk we shall see a strategy to achieve the best rate possible for the point-to-point channel with eavesdropper (while maintaining secrecy), in the one-shot regime.

Speaker:

Varun Narayanan, TIFR

Tuesday, 12 February 2019, 16:00 to 17:00

**Abstract: **We will discuss Braverman and Rao's result that shows that the internal communication cost is same as the amortized communication complexity.

Speaker:

Siddharth Bhandari, TIFR

Friday, 1 February 2019, 17:15 to 18:15

**Abstract: **For a set $S$ of $n$ points in the unit square $U$, let $T(S)$ be the minimum area of a triangle whose vertices are three distinct points of $S$. Let $T(n)=max T(S)$ where $S$ ranges over all set of $n$ points in U.

Speaker:

Kshitij Gajjar, TIFR

Friday, 25 January 2019, 17:15 to 18:15

**Abstract:** In this talk, we will see a close connection between alternation-free sequences of words over the alphabet $\mathbb{Z}_n$ and parametric shortest paths in certain graphs.

Speaker:

Marc Vinyals, TIFR

Friday, 7 December 2018, 17:15 to 18:15

Abstract: Randomness can provide an exponential saving in the amount of communication needed to solve a distributed problem, and the canonical example of this is equality.

Speaker:

Vidya Sagar Sharma, TIFR

Friday, 30 November 2018, 17:15 to 18:15

Abstract: It is well known that multi-player potential game is PLS-complete.We show that constant player potential game is also PLS-complete.We also show that,there exist a constant-player potential game with some initial strategy such that it can

Speaker:

Anamay Tengse, TIFR

Friday, 16 November 2018, 16:00 to 17:00

**Abstract: **A polynomial $f(x_1,\ldots,x_n)$ is said to be an identity for $m \times m$ matrices if $f(M_1,\ldots,M_n) = 0$ for all choices of $m \times m$ matrices for $M_i$s.