## Speaker:

## Organisers:

## Time:

## Venue:

Abstract: We shall discuss the logical interpretation of Topology and Topological interpretations of various Logics.

Prabhat Jha

Friday, 10 August 2018, 17:15 to 18:15

Abstract: We shall discuss the logical interpretation of Topology and Topological interpretations of various Logics.

Speaker:

Siddharth Bhandari, TIFR

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

We will prove the following theorem which gives an alternate proof to the Erdős-Hanani conjecture.

Speaker:

Nikhil S Mande, TIFR

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

Abstract:

We consider functions computable efficiently by "linear decision lists", which are decision lists where the queries are linear threshold functions.

Kunal Dutta

Friday, 20 July 2018, 14:00 to 15:00

**Abstract:** In this talk we shall see three very different areas of applications of combinatorics in mathematics and computer science, illustrating different flavours of combinatorial reasoning.

Andrew Heunis

Tuesday, 24 July 2018, 16:00 to 17:00

We address a problem of stochastic optimal control motivated by portfolio optimization in mathematical finance, the goal of which is to minimize the expected value of a general quadratic loss function of the wealth at close of trade when there is

Madhu Sudan

Wednesday, 11 July 2018, 14:00 to 15:00

I will describe a recent approach to designing codes that correct for "editing" errors - i.e., where an adversary is allowed to delete some of the symbols in a string being transmitted and insert new symbols. The classical Hamming model of errors

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}$.

Abhik Ray

Friday, 6 July 2018, 14:30 to 15:30

Even though classical computers have evolved immensely in the past decades, there remain problems that we can never imagine solving on a classical computer in reasonable time.

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