# Past Events

# Tensor Rank and Algebraic Formula Lower Bounds

## Organisers:

## Time:

Tensor are higher dimensional analogues of matrices and there is a notion of the rank of a tensor (similar to matrices).

# Existence of Strategy in Games

## Organisers:

## Time:

Games are used to model many instances arising from interaction of more than one computational agent. In program synthesis, existence of strategy is the key in deciding the existence of a program with a given set of specifications.

# Banach-Tarski Paradox

## Speaker:

## Organisers:

## Time:

In this talk we will give a proof of the fact that the two dimensional sphere can be partitioned into finitely many pieces in such a way that a rearrangement of the pieces produces two disjoint copies of the original sphere.

Zoom link:

# Element distinctness using arbitrary binary gates

## Time:

We will study the Decision-Tree complexity of element distinctness using arbitrary binary gates (an instance of which is comparison gates). Concretely, let $m$ and $n$ be natural numbers with $m>n$.

# Paper: Pseudorandom Generators from Polarizing Random Walks by Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, and Shachar Lovett

# An Exploration of R ́enyi Divergence Based Upper Bounds on Generalization Error

# Differential Games in Spread of Diseases.

# An Introduction to Chordal Graphs And Clique Trees

## Organisers:

## Time:

An undirected graph is chordal if every cycle of length greater than three has a chord: namely, an edge connecting two nonconsecutive vertices on the cycle. A clique of a graph $G$ is any maximal set of vertices that is complete in $G$. Let $G$

# Approximating a polynomial as a sum of simple polynomials

## Speaker:

## Organisers:

## Time:

In this talk, we will consider algorithmic problems which follow the following template: given a real-valued multivariate polynomial f(x) of degree d, is it approximately equal to a sum of a few "simple" polynomials, i