Combinatorics Course Description: Discrete Mathematics is a branch of mathematics concerned with “discrete” mathematical structures instead of “continuous”. Combinatorics studies how such discrete structures can be combined or arranged. One of the first questions one asks related to such discrete mathematical structures is 'How many of a certain kind are there?'. In this course, we will understand what is meant by counting discrete mathematical structures and what constitutes a good answer to such a counting question.
Discrete mathematics has applications in a variety of fields and lies at the intersection of pure mathematics, applied mathematics, and computer science. This course will showcase certain objects that appear in various situations encompassing not only mathematics and computer science but also physics. While studying these objects we will also understand some of the most fundamental tools and techniques in combinatorics. If you have enjoyed solving puzzles such as 'How many ways can you tile a 2 x n board using dominoes' or ever wondered how Pascal's triangle is useful in mathematics, then you will enjoy this course. In particular, we will answer both of these questions in the course.
| Organization/Institution | Position | Period |
|---|---|---|
| Ahmedabad University, India | Assistant Professor | 2023-present |
| Indian Institute of Information Technology Senapti, Manipur, India | Assistant Professor (Guest), Department of Humanities and Basic Sciences | 2022-present |
| School of Mathematics, Cardiff University, UK | Research Associate | 2019-2022 |
