| 4th July 2016 | |
| 0915-0930 | Registration |
| 0930-1100 |
Origami Session We will make modular origami models of geometric objects. |
| 1130-1300 |
Sequences and Information Rahul Siddharthan How does written language work? How does a linear sequence of symbols convey information to the reader? How is this different from computer languages and how is it similar? How do we teach computers to "understand" language? How does Google Translate work? We will talk about the basics of information theory, communication, and language models, and its applications both in analysing language and in other "sequence of symbols", in particular, DNA and biology. Slides from the talk |
| 1400-1500 |
Group Theory: the Language of Symmetry Amritanshu Prasad We will explore the symmetries of geometric objects that we made in the origami session. We will see that the set of all symmetries of such an object comes endowed with a group structure. We will study some interesting examples of finite groups by realizing them as such symmetry groups. |
| 1530-1700 |
Lie Groups: A Quick Tour of Symmetries and Invariance in Math, Physics and Engineering Sunita Vatuk We will continue to develop the story that began with the origami session and Amritanshu Prasad's talk. Symmetry plays a huge role in many branches of mathematics and physics. We will recast some familiar problems into the language of symmetry and equivalence, and then begin to explore a few of the infinite groups that come up in classic physics and engineering. No previous exposure to Lie groups is assumed. Slides for the talk |
| 5th July 2016 | |
| 0930-1100 |
How to Stably Spin a Cuboid Sushmita Venugopalan Consider a cuboid whose length, breadth and height are all different. It has 3 axes of rotation. Two of these axes are stable, whereas if the cuboid is spun around the third, it wobbles out of the orbit. I explain this phenomenon using equations of motion, motivating some geometry in the process. Slides for the talk |
| 1130-1300 |
On Problems that Computers will Never Solve Teodor Knapik In 1936, a few years before deciphering messages encrypted by Enigma, Alan Turing made an essential discovery while looking for an answer to David Hilbert's "Entscheidungsproblem" (decision problem). His discovery has many deep consequences for mathematics. It also became one of the most important foundations of computer science. We outline Turing's discovery starting from a puzzle. Slides for the talk |
| 1400-1530 |
Some Interesting Real-World Problems Viewed Through the Data Science
Lens Nandan Sudarsanam In this talk we look at four real-world problems, which, like most real world problems, defy a cookie cutter application of basic quantitative methods. Instead we show that these problems can be addressed through extensions and modifications of the traditional data science approaches. Specifically, I will talk about PU (Positive and Unlabeled) Learning, Graph coloring, Bandit problems in reinforcement learning, and Temporal difference learning. Slides for the talk |
| 1600-1700 |
Panel Discussion on Careers Involving Mathematics
The session will be chaired by R. Ramanujam, professor of theoretical computer science at IMSc.
The panelists are:
|