## Speaker:

## Organisers:

## Time:

## Venue:

Abstract: In this talk I will discuss some linear algebraic methods to prove lower bounds.

Tulsi Mohan Molli

Friday, 8 August 2014, 14:30 to 16:00

Abstract: In this talk I will discuss some linear algebraic methods to prove lower bounds.

Speaker:

Swagato Sanyal, TIFR

Friday, 18 July 2014, 14:30 to 16:00

Abstract: Let f: F_2^n -> {+1, -1} be a Boolean function with the first Fourier norm A and Fourier sparsity s. We will prove that there is an affine subspace of the vector space F_2^n, of dimension O(A), on which the f is constant.

Speaker:

Gugan Thoppe, TIFR

Friday, 11 July 2014, 14:30 to 16:00

Abstract: Mathew Kahle and Elizabeth Meckes recently established interesting results concerning the topology of the clique complex $X(n,p)$ on an Erdos Renyi graph $G(n,p).$ Specifically, they showed that, if $p = n^{\alpha}$

Speaker:

Bodhayan Roy, TIFR

Friday, 20 June 2014, 16:15 to 17:30

Abstract: In this talk we study the problem of partitioning a plane set into minimum number of parts with smaller diameters.

Speaker:

Anantha Karthik R, TIFR

Friday, 13 June 2014, 14:30 to 16:00

Analysis of many real world networks like the WWW, financial networks , biological networks etc is modelled by random graphs .

Speaker:

Shishir Pandey, TIFR

Friday, 30 May 2014, 14:30 to 16:00

Abstract: Multidimensional scaling (MDS) is used to visualize pairwise similarity between objects.

N.V. Narendra Kumar

Friday, 4 April 2014, 14:30 to 16:00

Abstract: From a security perspective, in the current age where malware (malicious software) distribution is rampant, it is dangerous to execute programs downloaded from the internet.

Speaker:

Sarat Babu Moka, TIFR

Friday, 28 March 2014, 14:30 to 16:00

Abstract: Necessary and sufficient conditions on a function $f(p)$ are given for the existence of a simulation procedure to simulate a Bernoulli random variable with success probability $f(p)$ from

Speaker:

Nikhil S Mande, TIFR

Friday, 14 March 2014, 14:30 to 16:00

Abstract: In this talk, we will prove that the group of symmetries of a standard (3x3x3) Rubik's cube is isomorphic to (\mathbb{Z}_37 \times \mathbb{Z}_2^{11}) \rtimes ((A_8 \times A_{12}) \rtimes Z_2).

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 7 February 2014, 14:30 to 16:00

Abstract: Most of the achievability proofs in Information theory are based on the concept of typicality. However, this typicality technique does not seem to be good enough to give achievability bounds in the most general settings, i.e.