Explicit two-source extractors and resilient functions (Chattopadhyay & Zuckerman 2019)

English Podcast Start at 00:00:00Bengali Podcast Start at 00:22:35Hindi Podcast Start at 00:29:08🎙️✨ Welcome to another mind-bending episode of Revise and Resubmit! ✨🎙️Today, we're dialing up the excitement in the mathematical multiverse and diving into a landmark paper that doesn't just crack a long-standing problem—it shatters it with the precision of pure theory and the elegance of mathematical art. 🧠⚡📘 Title? "Explicit Two-Source Extractors and Resilient Functions"🧑‍🔬 Authors? The brilliant duo — Eshan Chattopadhyay and David Zuckerman.🏛️ Journal? The mighty Annals of Mathematics, no less.🏆 First dropped as a Best Paper at the 48th ACM Symposium on Theory of Computing in 2016, and fully blossomed into its final form in 2019, thanks to Princeton University and the Institute of Advanced Study. Yes, that Princeton.So what’s the big deal? 🤔Well, picture this: You're trying to extract a single clean bit of randomness from two messy, weak sources. Previous math legends like Bourgain could do it only if each source had nearly half the entropy of the entire input. But Chattopadhyay and Zuckerman? They sliced that need down to just polylogarithmic entropy. 📉💥Their tool? An exquisitely crafted Boolean function—monotone, almost-balanced, and unbelievably resilient. Even if an adversary controls a ton of the input bits, the output holds strong. 🤖🛡️And here's the twist—this extractor doesn't just stay in the realm of theory. It pushes the limits on Ramsey graph constructions, nudging closer to long-dreamed bounds. Barak et al. laid the groundwork, and these two took the leap. 🧩🧗But how does one even design such a function that laughs in the face of adversarial interference?What does it take to extract order from chaos—explicitly, reliably, and with mathematical elegance?💬 Stick around as we peel back the layers of randomness, resilience, and radical breakthroughs!And a massive thank you to the authors—Eshan Chattopadhyay and David Zuckerman—for this phenomenal contribution. 🙏📄📢 Don’t forget to subscribe to this podcast, Revise and Resubmit, on Spotify, 📻smash that bell on our YouTube channel Weekend Researcher 🔔📺,and catch us on Amazon Prime and Apple Podcast 🍎🎧Now here's your question to chew on:🌪️ If randomness can be extracted from weak, chaotic sources… could the same principles apply to the way we make decisions in complex systems? Could we find order, even meaning, in the noise of real life? 🌌Let’s find out—together. 🎧ReferenceChattopadhyay, E., & Zuckerman, D. (2019). Explicit two-source extractors and resilient functions. Annals of Mathematics, 189(3). https://doi.org/10.4007/annals.2019.189.3.1Eshan Chattopadhyay and David Zuckerman. 2016. Explicit two-source extractors and resilient functions. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (STOC '16). Association for Computing Machinery, New York, NY, USA, 670–683. https://doi.org/10.1145/2897518.2897528‌Youtube channel link https://www.youtube.com/@weekendresearcherSupport us on Patreonhttps://patreon.com/weekendresearcher