## Speaker:

## Organisers:

## Time:

## Venue:

Origami is the art of paper folding. It can also be described mathematically with a set of seven axioms, which are complete. In this talk, we will see the following.

Sagar Shrivastav

Friday, 18 May 2018, 17:15 to 18:15

Origami is the art of paper folding. It can also be described mathematically with a set of seven axioms, which are complete. In this talk, we will see the following.

Ashwin Deopurkar

Friday, 11 May 2018, 17:15 to 18:15

This would be an elementary and concrete introduction to classical projective geometry. We'd start with Euclidean geometry of points, lines and circles.

Abhishek Khetan

Friday, 4 May 2018, 17:15 to 18:15

In this talk we will discuss a topological proof of the fundamental theorem of algebra which states that any non-constant polynomial over the field of complex numbers has a complex root.

Speaker:

Neha Sangwan, TIFR

Friday, 27 April 2018, 16:00 to 17:00

In this talk, we will discuss the multiplicative weights algorithm and its application in approximately finding the optimal row and column strategies in a two player, zero sum game.

Speaker:

Anamay Tengse, TIFR

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

In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.

Speaker:

Suhail Sherif, TIFR

Friday, 13 April 2018, 16:00 to 17:00

A threshold function on n bits is a function that can be represented as the sign of a linear function of its inputs, i.e. f(x) = sign(w_1 x_1 + ... w_n x_n + c)

Speaker:

Prerona Chatterjee, TIFR

Friday, 6 April 2018, 17:15 to 18:15

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 16 March 2018, 17:15 to 18:45

We discuss a technique that provides a sufficient condition for establishing a Markov chain on the joint distribution.

Speaker:

Aditya Nema, TIFR

Friday, 2 February 2018, 17:15 to 18:45

In this talk I'll be presenting the result of Beigi et.al.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 19 January 2018, 17:15 to 18:45

A congestion game is a game where the cost of a player for using a resource depends on all the players using that resource.