Venue: DLT 7
Time | Day 1 (May 28) |
Day 2 (May 29) |
Day 3 (May 30) |
---|---|---|---|
08:30 – 09:00 | Registration | ||
09:00 – 09:30 | Welcome & Opening Remarks | ||
09:30 – 11:00 |
Minicourse I: Part 1 M K Srinivasan |
Minicourse I: Part 2 M K Srinivasan |
Minicourse I: Part 3 M K Srinivasan |
Tea / Coffee Break | |||
11:15 – 12:45 | Contributed Talk: Session 1 | Contributed Talk: Session 3 | Contributed Talk: Session 4 |
Hiranya K Dey | Nishu Kumari | Mohan Ravichandran | |
Anurag Singh | Velmurugan S | Himanshu Chandrakar | |
Rajat Adak | Sadhanandh V | Prafullkumar Tale | |
Lunch Break | |||
14:00 – 15:30 |
Minicourse II: Part 1 Nishad Kothari |
Minicourse II: Part 2 Nishad Kothari |
Minicourse II: Part 3 Nishad Kothari |
Tea / Coffee Break | |||
16:00 – 17:30 | Contributed Talk: Session 2 | Poster Session | Contributed Talk: Session 5 |
Santhosh Raghul | Chaithra P | ||
V Sathish Kumar | DLT 7 Lobby Area | S P Narayanan | |
Moumanti Podder | Shraddha Srivastava | ||
17:30 – 17:45 | Day 1 Ends | Day 2 Ends | Valedictory Function |
19:30 – 22:00 | Conference Dinner (VGH Lawns) | Conference Ends |
Boolean algebra is the poset of subsets of a finite set and projective geometry is the poset of subspaces of a finite dimensional vector space over a finite field with q elements. We discuss q-analogs of two famous results (one bijective and one algebraic) on the Boolean algebra.1. The bracketing algorithm gives an explicit symmetric chain decomposition (SCD) of the Boolean algebra. Griggs showed (using network flows) the existence of a SCD of the projective geometry. Greene and Kleitman asked for an explicit construction. Bjorner asked whether the projective geometry has a SBD (symmetric Boolean decomposition) (more general than an SCD). The Greene-Kleitman problem was solved in a remarkable paper of Vogt and Voigt. We build on this paper and give an explicit SBD of the projective geometry. (Joint work with Jonathan Farley)2. The Terwilliger algebra of the hypercube (= Hasse diagram of the Boolean algebra) is one of the basic objects in algebraic graph theory. It is a natural problem to find its q-analog. This was solved recently in two papers, the first by Ghosh and Srinivasan, and the second by Terwilliger. If time permits, we shall discuss a possible connection between the two problems.
The study of perfect matchings (and, more generally, of matchings) has played a central role not only in the development of graph theory, but also in the growth of various other areas of combinatorics such as polyhedral combinatorics, enumerative combinatorics, combinatorial optimization, etc. For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs — that is, those connected graphs wherein each edge participates in some perfect matching. Ergo, for more than half a century now, several researchers have invested in developing an extensive theory, and these efforts have culminated in the recently published book "Perfect Matchings: A Theory of Matching Covered Graphs" by Lucchesi and Murty. This minicourse is inspired by, and will be based on, their monograph.
The objectives of this minicouse are twofold: firstly, to introduce the participants to the salient features of the aforementioned theory — especially, the tight cut decomposition theory (including Lovász's Uniqueness Theorem) and the ear decomposition theory (that drew inspiration from the well-known Whitney's Ear Decomposition Theorem); and secondly, to demonstrate their interplay towards solving various problems — most of which were major open problems back in the day. Time permitting, we will also discuss open problems as well as their special cases that are already solved.
Prerequisites for the Minicourse on Perfect Matchings: theory and problems
This advanced minicourse is intended for participants with prior exposure to graph theory. In particular, we recommend reviewing Module 5 (Matchings) from Dr. Nishad Kothari’s Structural Graph Theory course, available here. The module includes 11 video lectures (each approximately 50 minutes), freely available on YouTube.
After completing all 11 lectures, you may contact Dr. Kothari at nishad@cse.iitm.ac.in to request an assignment that can help you evaluate your understanding of the material.
Being a popular tourist destination and a haven for relaxation, Goa offers superb connectivity to major cities throughout the country. Nesting in the lap of verdant hills, overlooking the Zuari River, BITS, Pilani K K Birla Goa Campus is spread over an area of 180 acres. The location of the campus is unique with respect to scenic beauty and panoramic view of picturesque surroundings encompassing the Zuari River, hillocks, waterways, forests, and landscape.
Note: BITS Pilani K K Birla Goa Campus is on the side of a bypass road to NH17B, and regular buses will not go via Campus, so avoid taking a local/ city bus.
Accessing BITS Pilani Goa Campus is facilitated through diverse transportation options, guaranteeing convenience for both attendees and visitors.
Goa boasts two airports, namely Goa Dabolim International Airport (GOI), situated approximately 5 km away and Manohar International Airport (Mopa, GOX), which is roughly at a distance of 55 km from BITS Pilani K K Birla Goa campus, the venue for the symposium. Goa International Airport, being the closest, is extensively connected to major cities across India, providing a time-efficient air travel option. One can find regular flights to this tropical paradise from cities like New Delhi, Mumbai, Bengaluru, Hyderabad, Kochi, and Chennai. The fastest way to reach Goa is often by taking a flight from Mumbai or Bengaluru, with the journey typically lasting around an hour. Air India is recognized as the national carrier. However, travelers can choose among various airlines, including SpiceJet, IndiGo, Air Asia, Akasa Air and Vistara. Upon arrival, pre-paid taxis are readily available to reach the Campus.
Pre-paid Taxi counters are available at the airport arrival area.
Goa International Airport (Dabolim) to BITS Pilani K K Birla Goa Campus: ~Rs. 500/-
Manohar International Airport (Mopa) to BITS Pilani K K Birla Goa Campus: ~Rs. 3,000/-
One can also avail the ‘Goa Miles’ cab service via the Government certified transportation portal: https://www.goamiles.com.
Note: The rates may vary accordingly and can be higher if not pre-paid. The above rates and information are representative and approximate. Organizers are not responsible for any deviation in prices and information mentioned above.
Those inclined towards rail travel can commute by train and arrive at Karmali Railway Station, located about 20 km, Madgaon railway station, which is 22 km away or Vasco railway station which is 10 km from BITS Pilani K K Birla Goa Campus. These railway stations have established connections to major cities in the region.
Karmali Railway Station to BITS Pilani K K Birla Goa Campus: ~Rs. 2,000/-
Madgaon Railway Station to BITS Pilani K K Birla Goa Campus: ~Rs. 2,500/-
Note: The above rates and information are representative and approximate. Organizers are not responsible for any deviation in prices and information mentioned above.
The campus is easily reachable by road, with well-maintained highways and road networks linking it to neighboring towns and cities like Mumbai, Bangalore, Pune, Hyderabad etc.
On-Campus Accommodation: We are in the process of arranging on-campus accommodation for student participants in the student hostels. Detailed information will be announced shortly.
Nearby Hotels: Goa, a renowned tourist destination, offers a variety of accommodation options. You can click here to explore nearby choices and arrange your own accommodation.