## Speaker:

## Organisers:

## Time:

## Venue:

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

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.

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

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+

Dr. Simoni Shah was awarded the Sasken Best Thesis Award for the year 2013-14 for her Ph.D.

Dr. Ashutosh Gupta joins the School of Technology and Computer Science as a Reader.

- ‹ previous
- 7 of 17
- next ›