## Speaker:

Raghuvansh Saxena

## Organisers:

## Time:

Tuesday, 21 February 2023, 09:00

Raghuvansh Saxena

Tuesday, 21 February 2023, 09:00

Rafael Oliviera

Monday, 20 February 2023, 14:30 to 15:30

Speaker:

Eeshan Modak, TIFR

Friday, 17 February 2023, 16:00 to 17:00

In the composite hypothesis testing setting, the detector receives n i.i.d. samples either from a distribution p∈P or from a distribution q∈Q. It then decides the correct set from which the samples were drawn.

Speaker:

Malhar Ajit Managoli, TIFR

Friday, 10 February 2023, 16:00 to 17:00

Fermat's two square theorem states that:

An odd prime p can be written as a sum of two squares if and only if p = 1 (mod 4)

An odd prime p can be written as a sum of two squares if and only if p = 1 (mod 4)

Sabyasachi Chatterjee

Friday, 10 February 2023, 14:00 to 15:00

Speaker:

Shanthanu Suresh Rai, TIFR

Friday, 3 February 2023, 16:00 to 17:00

What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result can be extended to cover irregular graphs as well.

Nikhil Kumar

Tuesday, 31 January 2023, 09:30 to 10:30

Sourav Chakraborty

Friday, 27 January 2023, 16:00 to 17:00

Dr. Justin Gilmer

Tuesday, 24 January 2023, 09:30 to 10:30

Speaker:

Arghya Chakraborty, TIFR

Friday, 20 January 2023, 16:00 to 17:00

In any tournament between several participants, transitivity is sometimes not satisfied (i.e. A may defeat B, B defeats C and C in turn defeats A). In any case, we shall have to define a winner.