Mathematics Society, IIT Delhi

📢SMMC 2025 Pre-Test

We’re conducting a Pre-SMMC next week to shortlist participants for the Simon Marais Mathematics Competition!

Main Exam: Saturday, 11th Oct (Morning & Evening sessions)
Eligibility: Undergraduates (PG & final-year Dual Degree not eligible)
👥 Participate solo or in teams — rules: https://www.simonmarais.org/rules.html

📌 Register by: 16 Aug 2025 EOD
Scan QR in poster to fill the form

For queries: [email protected]

📢 MathSoc × DRW presents: Quantitative Insights with Sudeep Gupta

Join us for an exclusive 1:1 session with Sudeep Gupta, Head of Cumberland Trading - a global leader in crypto-asset trading since 2014. The discussion will cover opportunities & challenges in cryptocurrency trading, and potential full-time career pathways with Cumberland.

🗓 Starting Monday, 18th August
⏰ Time: 6:30 PM IST
📍 Mode: Online | Invite-only (Limited seats)

📌 How to join:
Scan the QR code on the poster to RSVP. Confirmations will be sent 48 hours prior to the event.

Da Vinci Trading League – IIT Delhi Edition

Step into the Da Vinci Trading League - where sharp minds go head-to-head in a fast-paced market making showdown! Team up, trade smart, and take on fellow students in a fun, high-energy challenge that’s all about strategy and speed. Top performers will be invited to an exclusive interview prep bootcamp, where we'll share insider tips to help you stand out during internship hiring season - plus, you'll have the chance to win the official Da Vinci Trading League Gift Bundle!

Event Details:
📅 Date: Saturday, 28th June
🕒 Time: 1:30 PM IST
⏱️ Duration: Approximately 1.5 hours (including a presentation from Da Vinci’s HR team)

Eligibility:
Open to students in their penultimate year of study with a passion for trading.
Note: Limited seats available — early registration is encouraged.

Register here:
https://davincitrading.com/da-vinci-trading-league-x-iit-delhi/

About Da Vinci: Da Vinci is a proprietary trading firm founded in 2015, specializing in market inefficiencies, volatility arbitrage, and delta-1 strategies. With offices in Amsterdam, Miami, and Mumbai, we trade on major exchanges across Asia and the US. We’re a fast-growing, non-hierarchical firm focused on smart, innovative work - and we're building a team of passionate trading minds. At Da Vinci, you’ll find sharp thinkers, real impact, and unlimited growth!

Join us this summer for Wolfram – Who by MathSoc & CAIC, IIT Delhi
Explore Number Theory, Graph Theory, Combinatorics, and Algebra
Take on the Mathbowl—weekly mini challenges, deep concepts
Learn. Collaborate. Discover.
Scan the QR to begin

📣 Greetings from MathSoc!

Confused about how to crack those dream corporate internships? 🧑‍💼💻 Join us for "Corporate Intern Ke Fundae", where seniors share how they landed amazing roles at Microsoft, Warner Bros, Graviton, Eightfold.ai, and Quadeye! 🚀

🗓 Sunday, 25th May
⏰ 3–4 PM
🌐 Online
🎯 Open to all branches!

✨ Get insider tips on applying, prepping, and excelling in tech & quant internships!

👉 Join the WA group for updates and link:
https://chat.whatsapp.com/BC8oOJKqTflIHfoE79KSef

Don’t miss out! 🎙🔥

Greetings from MathSoc IITD! 🎉
Applications are invited for the post of executives and volunteers, until 25th May, 2025.📣
B.Tech/Dual degree MnC students from all years and M.Sc. students can apply. It is required due to institute policies that CGPA of the applicants for executive post must be ≥ 7.
Form :- https://forms.gle/YTZLEWHhMEQrPJq18
If you are facing any difficulties while filling up this form, feel free to drop a message to
Ishan 9784870974
Akshat 9971859102

Greetings from MathSoc IITD! 🤝 Applications for executive posts are now open until 25th May, 2025. 📣
Eligible students include B.Tech/Dual degree MnC students from all years and M.Sc. students.
Please note that a CGPA of ≥ 7 is required due to institute policies.
If you encounter any difficulties while filling out the form, feel free to reach out to Ishan (9784870974) or Akshat (9971859102).

Continuing our journey through fascinating mathematical ideas, we’re excited to bring you the next session in our Beyond Lectures series! 🎉 This time, we shift gears from classical physics to theoretical computer science, as we dive into a clever twist on the well-known 3SUM problem and its implications in the world of fine-grained complexity.

📝 Topic: Revisiting the 3SUM Problem in Preprocessed Universes
🎙 Speaker: Pratyush Sharma

📖 Abstract:
We revisit the 3SUM problem in the preprocessed universes setting. We present an algorithm that, given three sets A,B,C of n integers, preprocesses them in quadratic time so that, for any subsets 𝐴',𝐵',𝐶', it can decide whether there exist a∈A', b∈B' ,c∈C' such that a+b=c, in time O(n^1.5 logn).
Beyond the algorithm itself, we’ll also explore what this result means in the broader context of computational complexity and how it contributes to our understanding of preprocessing and query efficiency in algorithm design.

🎤 About the Speaker:
Pratyush is a third-year undergraduate in the Mathematics Department. He pursued a research internship at Bocconi University, Italy, in the field of Theoretical Computer Science. Pratyush has a wide range of interests and loves participating in (and struggling through) all sorts of competitions that pique his curiosity. A passionate enthusiast of Maths Olympiads, you’ll often find him fixated on a single problem for hours. Outside the academic grind, he enjoys Chess and Table Tennis, and statistically speaking, has the highest probability of being found in his hostel at any given moment.

🗓 Date: 09/04/2025
📍 Venue: LH316
⏰ Time: 6 – 7 PM

Join us for an exciting session that explores cutting-edge ideas in algorithm design and computational complexity! Whether you’re into theoretical CS, algorithmic puzzles, or just love a good challenge, this talk has something for you.

Even if you’re new to the topic, feel free to swing by—Pratyush is always happy to chat about olympiads, competitions, and navigating research as an undergrad. P

Continuing our journey through fascinating mathematical ideas, we’re excited to bring you the next session in our Beyond Lectures series! 🎉 This time, we’ll dive into the Brachistochrone Problem and Calculus of Variations, exploring one of the most elegant problems in mathematical physics and optimization.

📝 Topic: Calculus of Variations and the Brachistochrone Problem
🎙 Speaker: Tejas Anand
📖 Abstract: Ever wondered what path a particle should take to descend the fastest under gravity? Why does nature seem to favor certain curves over others? And how does this relate to modern optimization techniques?
In this talk, we will explore the famous Brachistochrone Problem, which asks for the curve of fastest descent, and how it leads to the powerful framework of Calculus of Variations. We will derive the solution using the Euler-Lagrange equation, uncover its deep connection to physics, and discuss its impact on modern optimization, control theory, and beyond. To keep things lively, we’ll also throw in some quant puzzles and memes along the way!

🎤About the Speaker: Tejas is a passionate problem-solver with a deep interest in mathematics, optimization, and machine learning. He has pursued research internships at INRIA France and Kyoto University and is an incoming QR intern at Flow Traders HK. He is currently working on Graph Transformers and exploring their applications. Tejas enjoys interacting with people, asking thought-provoking questions, and exploring the mathematical structures underlying real-world problems. In his free time he plays the piano and guitar, with a special love for Chopin’s Nocturne Op. 9 No. 2. You can often find him near the library so feel free to go up to him and say hi; he might offer you a cup of coffee :)

🗓 Date: 06/02/2025
📍 Venue: LH325
⏰ Time: 7 - 8 PM

Join us for an engaging session that explores the Brachistochrone Problem and Calculus of Variations, uncovering their deep connections to optimization, physics, and beyond. Whether you’re passionate about mathematical problem-solving or just curious about how nature optimizes itself, this talk has something for you!

Continuing our exploration of captivating mathematical concepts, we’re excited to announce the next session in our series! 🎉 This time, we’ll dive into the fascinating world of Online Algorithms, a powerful framework for decision-making under uncertainty.

📝 Topic: The k-Server Problem and Its Weighted Variant in Online Algorithms
🎙 Speakers: Ankit Mondal & Adithya Bijoy
📖 Abstract: How do we make optimal decisions without knowing the future? Online algorithms provide a framework for tackling this challenge, balancing immediate decisions against an uncertain future. One of the most well-studied problems in this domain is the k-server problem, which models resource allocation in an online setting.

In this talk, we will introduce the fundamental constructs of the k-server problem, discuss key known results, and explore competitive analysis techniques used to evaluate online algorithms. We will then extend our discussion to the weighted k-server problem, highlighting new challenges and our contributions toward advancing its solutions.

🎤 About the Speakers:
🔹 Ankit Mondal is a fourth-year Computer Science student with a strong interest in anything mathematical. He has worked across diverse domains, including quantum architecture, quantitative trading, and online algorithms. If you ever need quant ke fundae, he’s your go-to person! When not stuck on challenging online problems, he enjoys playing online games like chess.
🔹 Adithya is a fourth-year Computer Science student with a childlike enthusiasm for anything even remotely related to Computer Science. He has explored research across multiple domains, including systems, verification, and algorithms. More recently, he has been deeply engrossed in the k-server problem, often found walking around campus, half-lost in his calculations. When he’s not contemplating adversarial request sequences, he’s probably skating across campus—sometimes arguing with security guards about it! If you catch him in a good mood, he’s always up for a CS discussion over a small treat at Naivedyam!

🗓 Date: 28/3/2025
📍 Venue: LH526
⏰ Time: 6-7pm

Tired of walking into interviews? No problem—now they’re coming straight to your doorstep!

🚀 The Integral Cup – National Level Integration Bee Competition! 🎯✨

For further updates join: https://chat.whatsapp.com/CKRiD9fPpUhCwoDZFIEyeb

🔥 Prize Pool: ₹2.5 Lakhs
🤝 Networking: Hiring opportunities from the top firms like Optiver, QRT & Jane Street
📍 Finals: June 2025 @ IIT Bombay (All expenses covered!)
🎁 Goodies & More!

🗓 Prelims: March 30, 2025
📍 LHC, IIT DELHI

Don’t miss this chance to compete with the best! 🏆
📞 Contact:
📌 Khushal Rawal: +91 9257282316
📌 Anshul Tanwar: +91 7015354736
IITD POC: Vagesh Mahajan: +91 9987035465

⚡ The clock is ticking, the numbers are waiting—Are you ready? ⚡

Mathsoc x Matiks presents the Ultimate Mental Math Showdown – a 7-day league from March 23rd to 31st, culminating in an epic final battle of the top 10 contenders.

Will you reach the supremum, or just be another element in the leaderboard set?

Compete, level up, and prove your math mastery!

📅 March 23rd - 31st
🎯 Real-time battles
🏆 Cash prizes and exclusive rewards!

*Register Here:* https://www.matiks.in/league/67da4c7723de80ebee9b7c92?utm_source=IITD&utm_campaign=leagues

and join the WhatsApp group to get daily updates!
https://chat.whatsapp.com/LmlMQ4ti4z3J8GIQm3VUyA