## Organisers:

## Time:

## Venue:

**Abstract: **A complex number z is said to be algebraic, if there is a univariate f(x) with real coefficients such that f(z)=0. For instance i, the square root of -1, is algebraic with f(x) being x^2 + 1.

Speaker:

Anamay Tengse, TIFR

Friday, 9 August 2019, 17:15 to 18:45

**Abstract: **A complex number z is said to be algebraic, if there is a univariate f(x) with real coefficients such that f(z)=0. For instance i, the square root of -1, is algebraic with f(x) being x^2 + 1.

Speaker:

Kshitij Gajjar, TIFR

Thursday, 1 August 2019, 16:00 to 17:00

**Abstract:** A bunch of disjoint axis-parallel rectangles are drawn on a single piece of paper.

Speaker:

Suhail Sherif, TIFR

Friday, 26 July 2019, 17:15 to 18:15

**Abstract:** Decision trees form a basic model of computation, with connections to many areas in complexity and approximation theory.

Speaker:

Suneel Sarswat, TIFR

Friday, 19 July 2019, 16:00 to 17:00

**Abstract:** In this talk, we introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade.

Speaker:

Anand Deo, TIFR

Friday, 28 June 2019, 17:15 to 18:15

Abstract: We analyse the equilibrium behaviour of a large network of banks in presence of incomplete information, where inter-bank borrowing and lending is allowed, and banks suffer shocks to assets.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 21 June 2019, 17:15 to 18:15

Abstract:

The $delta$-coin problem asks if a given function can distinguish between coins which are sampled independently with the probability of heads being $1/2+ \delta$ and those where the probability of heads is 1/2.

Speaker:

Kshitij Gajjar, TIFR

Friday, 14 June 2019, 17:15 to 18:15

**Abstract:** Given a graph $G$ with one source vertex $s$ and several target vertices, a shortest path tree rooted at $s$ is a subgraph of $G$ that preserves distances from $s$ to each of the target vertices.

Speaker:

Anamay Tengse, TIFR

Friday, 7 June 2019, 17:15

A tree is said to be n-universal if it "contains" all binary trees with at most n leaves. A result of Chung, Graham and Coppersmith from 1981 shows that when this containment is via sub-graphs, an n-universal tree requires size n^Omega(log(n)).

Speaker:

Aditya Nema, TIFR

Friday, 31 May 2019, 17:15 to 18:15

**Abstract:** In a breakthrough, Hastings(2009) showed that there exists quantum channels whose classical Holevo capacity is superadditive i.e.

Speaker:

Suhail Sherif, TIFR

Friday, 24 May 2019, 17:15 to 18:15

**Abstract: **The first observation that one makes when analyzing communication protocols between Alice and Bob is that a cost c protocol partitions the input space into 2^c combinatorial rectangles.